%0 Journal Article
%A TAKEFUJI, YOSHIYASU
%A LEE, KUO-CHUN
%T A Near-Optimum Parallel Planarization Algorithm
%D 1989
%R 10.1126/science.245.4923.1221
%J Science
%P 1221-1223
%V 245
%N 4923
%X 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.
%U http://science.sciencemag.org/content/sci/245/4923/1221.full.pdf