Graph Theory and Algorithms pp 207-216 | Cite as

# The two disjoint path problem and wire routing design

Conference paper

First Online:

- 14 Citations
- 370 Downloads

## Abstract

A new polynomial time algorithm is presented for finding two vertex-disjoint paths between two specified pairs of vertices on an undirected graph. An application of the two disjoint path algorithm to the automatic wire routing is also discussed.

Download
to read the full conference paper text

## References

- [1]Karp, R.M., "On the complexity of combinatorial problems", Networks 5, pp. 45–68 (1975).Google Scholar
- [2]Lynch, J.F., "The equivalence of theorem proving and the interconnection problem", ACM SIGDA Newsletter 5: 3 (1975).Google Scholar
- [3]Perl, Y. and Shiloach, Y., "Finding two disjoint paths between two pairs of vertices in a graph", J. Assoc. Comput. Mach. 25, pp. 1–9 (1978).Google Scholar
- [4]Shiloach, Y., "A polynominal solution to the undirected two paths problem", ibid. 27, pp. 455–56 (1980).Google Scholar
- [5]Even, S. and Tarjan, R.E., "Network flow and testing graph connectivity", SIAM J. Comput. 4, pp. 507–18 (1975).Google Scholar
- [6]Auslander, L. and Parter, S.V., "On imbedding graphs in the sphere", J. Math. Mech. 10, pp. 517–23 (1961).Google Scholar
- [7]Fisher, G.J. and Wing, O., "Computer recognition and extraction of planar graphs from the incidence matrix", IEEE Trans. CT-13, pp. 154–63 (1966).Google Scholar
- [8]Hopcroft, J.E. and Tarjan, R.E., "Efficient planarity testing", J. ACM 21, pp. 549–68 (1974).Google Scholar
- [9]Tarjan, R.E., "Depth-first search and linear graph algorithms", SIAM J. Comput. 1, pp. 146–60 (1972).Google Scholar
- [10]Johnson, D.R., "PC board layout techniques", Proc. 16th Design Automation Conf., pp. 337–43 (1979).Google Scholar
- [11]Lee, C.Y., "An algorithm for path connections and its applications", IRE Trans. EC-10, pp. 346–65 (1961).Google Scholar
- [12]Mori, H., et. al., "BRAIN: An advanced interactive layout design system for printed wiring boards", to be presented at the IEEE Internat. Conf. on Circuits and Computors (1980).Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1981