A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
A linear-time algorithm that does not need a planar embedding is presented for the problem of computing two vertex-disjoint paths, each with prescribed endpoints, in an undirected 3-connected planar graph.
Unable to display preview. Download preview PDF.
- 2.Harary, F.: Graph Theory. Addison-Wesley, Reading, Mass (1969)Google Scholar
- 3.Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) Advances in Computing Research, vol. 2, pp. 129–146. JAI Press, Greenwich, Conn (1984)Google Scholar