Graph contractability problem for vlsi layer assignment

Kuo En Chang*, Horng Fei Jyu, Wu Shuing Feng


研究成果: 雜誌貢獻期刊論文同行評審


The layer assignment problem for VLSI routing is the problem of determining which layers can be used for routing the wire segments in the interconnections of nets so that the number of vias is minimized. In this paper, we transform the problem of layer assignment for three-layer routing to the contractability problem of 3-colorable graph. This problem is shown to be NP-complete and a heuristic algorithm is proposed on the basis of the graph contractability model. From our experimental results, the algorithm is faster and efficient to generate very good results. In the average, the number of vias can be reduced by 30 percent or so.

ASJC Scopus subject areas

  • 一般工程


深入研究「Graph contractability problem for vlsi layer assignment」主題。共同形成了獨特的指紋。