New graph coloring algorithm for constrained via minimization

Ron Noteboom, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes a new layer assignment Algorithm for constrained via minimization in VLSI chip design. The new algorithm uses an intersect graph model and applies a pseudo two coloring technique in order to find a near optimal layer assignments in two layers. The pseudo two coloring problem is known to be NP-complete in the general case but a polynomial solution exists for planer graphs. This paper compares the proposed algorithm to optimal results produced in planar and nonplanar graphs as well as to another recent two coloring heuristic in random graphs. The paper also discusses the possibility of extending the algorithm to multilayers.

Original languageEnglish (US)
Title of host publicationMidwest Symposium on Circuits and Systems
EditorsMagdy A. Bayoumi, Ken W. Jenkins
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages363-366
Number of pages4
Volume1
StatePublished - 1994
EventProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2) - Lafayette, LA, USA
Duration: Aug 3 1994Aug 5 1994

Other

OtherProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2)
CityLafayette, LA, USA
Period8/3/948/5/94

Fingerprint

Coloring
Multilayers
Polynomials

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Noteboom, R., & Ali, H. H. (1994). New graph coloring algorithm for constrained via minimization. In M. A. Bayoumi, & K. W. Jenkins (Eds.), Midwest Symposium on Circuits and Systems (Vol. 1, pp. 363-366). Piscataway, NJ, United States: IEEE.

New graph coloring algorithm for constrained via minimization. / Noteboom, Ron; Ali, Hesham H.

Midwest Symposium on Circuits and Systems. ed. / Magdy A. Bayoumi; Ken W. Jenkins. Vol. 1 Piscataway, NJ, United States : IEEE, 1994. p. 363-366.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Noteboom, R & Ali, HH 1994, New graph coloring algorithm for constrained via minimization. in MA Bayoumi & KW Jenkins (eds), Midwest Symposium on Circuits and Systems. vol. 1, IEEE, Piscataway, NJ, United States, pp. 363-366, Proceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2), Lafayette, LA, USA, 8/3/94.
Noteboom R, Ali HH. New graph coloring algorithm for constrained via minimization. In Bayoumi MA, Jenkins KW, editors, Midwest Symposium on Circuits and Systems. Vol. 1. Piscataway, NJ, United States: IEEE. 1994. p. 363-366
Noteboom, Ron ; Ali, Hesham H. / New graph coloring algorithm for constrained via minimization. Midwest Symposium on Circuits and Systems. editor / Magdy A. Bayoumi ; Ken W. Jenkins. Vol. 1 Piscataway, NJ, United States : IEEE, 1994. pp. 363-366
@inproceedings{b9b2e00b34f84b70859d33baa93866da,
title = "New graph coloring algorithm for constrained via minimization",
abstract = "This paper proposes a new layer assignment Algorithm for constrained via minimization in VLSI chip design. The new algorithm uses an intersect graph model and applies a pseudo two coloring technique in order to find a near optimal layer assignments in two layers. The pseudo two coloring problem is known to be NP-complete in the general case but a polynomial solution exists for planer graphs. This paper compares the proposed algorithm to optimal results produced in planar and nonplanar graphs as well as to another recent two coloring heuristic in random graphs. The paper also discusses the possibility of extending the algorithm to multilayers.",
author = "Ron Noteboom and Ali, {Hesham H}",
year = "1994",
language = "English (US)",
volume = "1",
pages = "363--366",
editor = "Bayoumi, {Magdy A.} and Jenkins, {Ken W.}",
booktitle = "Midwest Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

T1 - New graph coloring algorithm for constrained via minimization

AU - Noteboom, Ron

AU - Ali, Hesham H

PY - 1994

Y1 - 1994

N2 - This paper proposes a new layer assignment Algorithm for constrained via minimization in VLSI chip design. The new algorithm uses an intersect graph model and applies a pseudo two coloring technique in order to find a near optimal layer assignments in two layers. The pseudo two coloring problem is known to be NP-complete in the general case but a polynomial solution exists for planer graphs. This paper compares the proposed algorithm to optimal results produced in planar and nonplanar graphs as well as to another recent two coloring heuristic in random graphs. The paper also discusses the possibility of extending the algorithm to multilayers.

AB - This paper proposes a new layer assignment Algorithm for constrained via minimization in VLSI chip design. The new algorithm uses an intersect graph model and applies a pseudo two coloring technique in order to find a near optimal layer assignments in two layers. The pseudo two coloring problem is known to be NP-complete in the general case but a polynomial solution exists for planer graphs. This paper compares the proposed algorithm to optimal results produced in planar and nonplanar graphs as well as to another recent two coloring heuristic in random graphs. The paper also discusses the possibility of extending the algorithm to multilayers.

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

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

M3 - Conference contribution

AN - SCOPUS:0028758812

VL - 1

SP - 363

EP - 366

BT - Midwest Symposium on Circuits and Systems

A2 - Bayoumi, Magdy A.

A2 - Jenkins, Ken W.

PB - IEEE

CY - Piscataway, NJ, United States

ER -