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

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). IEEE.