A near-optimum parallel planarization algorithm

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticle

69 Citations (Scopus)

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 languageEnglish
Pages (from-to)1221-1223
Number of pages3
JournalScience
Volume245
Issue number4923
Publication statusPublished - 1989
Externally publishedYes

Fingerprint

VLSI circuits
Printed circuit boards
Neurons
Neural networks
Networks (circuits)
Processing

ASJC Scopus subject areas

  • General

Cite this

Takefuji, Y., & Lee, K. C. (1989). A near-optimum parallel planarization algorithm. Science, 245(4923), 1221-1223.

A near-optimum parallel planarization algorithm. / Takefuji, Yoshiyasu; Lee, Kuo Chun.

In: Science, Vol. 245, No. 4923, 1989, p. 1221-1223.

Research output: Contribution to journalArticle

Takefuji, Y & Lee, KC 1989, 'A near-optimum parallel planarization algorithm', Science, vol. 245, no. 4923, pp. 1221-1223.
Takefuji, Yoshiyasu ; Lee, Kuo Chun. / A near-optimum parallel planarization algorithm. In: Science. 1989 ; Vol. 245, No. 4923. pp. 1221-1223.
@article{1a830dbf5272404f8ba16a4ca0d658fd,
title = "A near-optimum parallel planarization algorithm",
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.",
author = "Yoshiyasu Takefuji and Lee, {Kuo Chun}",
year = "1989",
language = "English",
volume = "245",
pages = "1221--1223",
journal = "Science",
issn = "0036-8075",
publisher = "American Association for the Advancement of Science",
number = "4923",

}

TY - JOUR

T1 - A near-optimum parallel planarization algorithm

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

PY - 1989

Y1 - 1989

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

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0037648004&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037648004&partnerID=8YFLogxK

M3 - Article

VL - 245

SP - 1221

EP - 1223

JO - Science

JF - Science

SN - 0036-8075

IS - 4923

ER -