A near-optimum parallel planarization algorithm

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)


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×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.

Original languageEnglish
Pages (from-to)1221-1223
Number of pages3
Issue number4923
Publication statusPublished - 1989
Externally publishedYes

ASJC Scopus subject areas

  • General


Dive into the research topics of 'A near-optimum parallel planarization algorithm'. Together they form a unique fingerprint.

Cite this