@article {TAKEFUJI1221,
author = {TAKEFUJI, YOSHIYASU and LEE, KUO-CHUN},
title = {A Near-Optimum Parallel Planarization Algorithm},
volume = {245},
number = {4923},
pages = {1221--1223},
year = {1989},
doi = {10.1126/science.245.4923.1221},
publisher = {American Association for the Advancement of Science},
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.},
issn = {0036-8075},
URL = {http://science.sciencemag.org/content/245/4923/1221},
eprint = {http://science.sciencemag.org/content/245/4923/1221.full.pdf},
journal = {Science}
}