### 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×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.

Original language | English |
---|---|

Pages (from-to) | 1221-1223 |

Number of pages | 3 |

Journal | Science |

Volume | 245 |

Issue number | 4923 |

DOIs | |

Publication status | Published - 1989 Jan 1 |

Externally published | Yes |

### ASJC Scopus subject areas

- General

## Fingerprint Dive into the research topics of 'A near-optimum parallel planarization algorithm'. Together they form a unique fingerprint.

## Cite this

Takefuji, Y., & Lee, K. C. (1989). A near-optimum parallel planarization algorithm.

*Science*,*245*(4923), 1221-1223. https://doi.org/10.1126/science.245.4923.1221