TY - JOUR
T1 - A Near-Optimum Parallel Planarization Algorithm
JF - Science
JO - Science
SP - 1221
LP - 1223
M3 - 10.1126/science.245.4923.1221
VL - 245
IS - 4923
AU - TAKEFUJI, YOSHIYASU
AU - LEE, KUO-CHUN
Y1 - 1989/09/15
UR - http://science.sciencemag.org/content/245/4923/1221.abstract
N2 - 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.
ER -