论文信息 - Minimum-Via Topological Routing

Minimum-Via Topological Routing

A new approach to the two-dimensional routing utilizing two layers is proposed. It consists of two major steps, topological routing and geometrical mapping. This paper describes the topological routing algorithm in detail. Based on a circle graph representation of the net intersection information of the routing problem, a maximal set of nets that can be routed without vias are selected. The layer assignments for the selected nets are determined by a global analysis so that the total number of vias needed is minimum. The layer assignment problem turns out to be a maximum-cut problem on an edge-weighted graph and we developed a greedy algorithm for it. According to the layer assignments, the detailed topological routes are then generated.

Chi-Ping Hsu

[1] R. Pinter. Optimal layer assignment for interconnect , 1984 .

[2] Chi-Ping Hsu. A New Two-Dimensional Routing Algorithm , 1982, DAC 1982.

[3] Masao Iri,et al. Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time" , 1977, SIAM J. Comput..

[4] Fanica Gavril,et al. Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[5] F. Hadlock,et al. Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[6] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.

[7] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[8] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..