Abstract
In the boundary single-layer routing problem (BSLR), there is a planar graph, a collection of terminals on the boundary of the infinite face and a set of multi-terminal nets. A solution of BSLR consists of a set of vertex-disjoint trees interconnecting the terminals belonging to the same (multi-terminal) net. An algorithm, unifying and generalizing previous BSLR algorithms, to solve an arbitrary instance of BSLR, is presented. Problems involving slidable terminals (i.e., when terminals can slide within a certain range on the boundary) and permutable terminals (i.e., when positions of some terminals [going to the same gate] can be interchanged) are optimally solved. The proposed algorithm runs in O (e) time, where e is the number of edges in the input graph. The result is extended to handle gridless routing environments.
This work was supported in part by National Science Foundation under Grant MIP 8709074.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.A. Buckingham, “Circle Graphs”, Ph.D. Thesis, Courant Institute of Mathematical Sciences, Computer Science Department, Report No. NSO-21, October 1980.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, New York, American Elsevier Pub. Co., 1976.
C.P. Hsu, “General River Routing Algorithm”, Proceedings of 20th Design Automation Conference, 1983, pp. 578–583.
J. M. Ho, M. Sarrafzadeh, G. Vijayan and C. K. Wong, “Pad Minimization for Planar Routing of Multiple Power Nets”, IEEE Transactions on Computer-Aided Design, Vol. CAD-9, No. 4, April 1990, pp. 419–426.
K.F. Liao, D.T. Lee and M. Sarrafzadeh, “Planar Subset of Multi-terminal Nets”, INTEGRATION: The VLSI Journal, North-Holland, September 1990.
C.E. Leiserson and F.M. Maley, “Algorithms for Routing and Testing Routability of Planar VLSI Layouts”, STOC, 1985, pp. 69–78.
C.E. Leiserson and R.Y. Pinter, “Optimal Placement for River Routing”, SIAM Journal on Computing, Vol. 12, No. 3, Aug. 1983, pp. 447–462.
K.F. Liao and M. Sarrafzadeh, “Boundary Single-Layer Routing with Movable Terminals”, to appear in IEEE Transactions on Computer-Aided Design.
F. M. Maley, “Single-Layer Wire Routing”, Ph.D. Thesis, 1987, Massachusetts Institute of Technology.
M. Marek-Sadowska and T.T.-K. Tarng, “Single-layer Routing for VLSI: Analysis and Algorithms”, IEEE Transactions on Computer-Aided Design, Vol. CAD-2, No. 4, October 1983, pp. 246–259.
R.Y. Pinter, “River Routing: Methodology and Analysis”, The Third Caltech Conference on VLSI, March 21–23, 1983.
D. Richards, ”Complexity of Single-Layer Routing”, IEEE Transactions on Computers, Vol. C-33, No. 3, March 1984, pp. 286–288.
K.J. Supowit, “Finding a Maximum Planar Subset of a Set of Nets in a Channel”, IEEE Transactions on Computer-Aided Design, Vol. CAD-6, No. 1, January 1987, pp. 93–94.
Z.A. Syed and A.El. Gamal, “Single Layer Routing of Power and Ground Networks in ICs”, Journal of Digital Systems, No. 1, Spring 1982, pp. 53–63.
X.M. Xiong and E.S. Kuh, “The Scan Line Approach to Power and Ground Routing”, Proceedings of IEEE International Conference of Computer Aided Design, 1986, pp. 6–9.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liao, KF., Sarrafzadeh, M. (1991). Vertex-disjoint trees and boundary single-layer routing. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive