Graph contractability problem for VLSI layer assignment |
| |
| Authors: | Kuo‐En Chang Horng‐Fei Jyu Wu‐Shuing Feng |
| |
| Affiliation: | 1. Department of Information and Computer Education , National Taiwan Normal University , Taipei, Taiwan, 10610, R.O.C.;2. Department of Electrical Engineering , National Taiwan University , Taipei, Taiwan, 10764, R.O.C. |
| |
| Abstract: | Abstract 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. |
| |
| Keywords: | NP‐complete layer assisgnment graph contractability crossing graph |
|
|
