抄録
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.
本文言語 | English |
---|---|
ページ(範囲) | 1221-1223 |
ページ数 | 3 |
ジャーナル | Science |
巻 | 245 |
号 | 4923 |
DOI | |
出版ステータス | Published - 1989 |
外部発表 | はい |
ASJC Scopus subject areas
- 一般