RT Journal Article
SR Electronic
T1 A Near-Optimum Parallel Planarization Algorithm
JF Science
JO Science
FD American Association for the Advancement of Science
SP 1221
OP 1223
DO 10.1126/science.245.4923.1221
VO 245
IS 4923
A1 TAKEFUJI, YOSHIYASU
A1 LEE, KUO-CHUN
YR 1989
UL http://science.sciencemag.org/content/245/4923/1221.abstract
AB 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.