Title: A Near-Optimum Parallel Planarization Algorithm
Abstract: A near-optimum parallel planarization algorithm is presented. The planarization algorithm, which is designed to embed a graph on a plane, uses a large number of simple processing elements called neurons. The proposed system, composed of an N x N neural network array (where N is the number of vertices), not only generates a near-maximal planar subgraph from a nonplanar graph or a planar graph but also embeds the subgraph on a single plane within 0(1) time. The algorithm can be used in multiple-layer problems such as designing printed circuit boards and routing very-large-scale integration circuits.
Publication Year: 1989
Publication Date: 1989-09-15
Language: en
Type: article
Indexed In: ['crossref', 'pubmed']
Access and Citation
Cited By Count: 97
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot