Skip to main content
SpringerLink
Log in

Complexity of disjoint paths problems in planar graphs

  • Conference paper
  • First Online:
Algorithms—ESA '93 (ESA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 726))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. S. Fortune, J. Hopcroft and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111–121.

    Google Scholar 

  2. R.M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975) 45–68.

    Google Scholar 

  3. M.R. Kramer and J. van Leeuwen, The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits, in: ” VLSI Theory” (F.P. Preparata, ed.), JAI Press, London, pp. 129–146.

    Google Scholar 

  4. J.F. Lynch, The equivalence of theorem proving and the interconnection problem, (ACM) SIGDA Newsletter 5 (1975) 3:31–36.

    Google Scholar 

  5. B. Reed, N. Robertson, A. Schrijver and P.D. Seymour, Finding disjoint trees in planar graphs in linear time, in: “Graph Structures” (N. Robertson and P.D. Seymour, eds.), A.M.S. Contemporary Mathematics Series, American Mathematical Society, 1993.

    Google Scholar 

  6. H. Ripphausen, D. Wagner, and K. Weihe, The vertex-disjoint Menger problem in planar graphs, preprint, 1992.

    Google Scholar 

  7. N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, preprint, 1986.

    Google Scholar 

  8. N. Robertson and P.D. Seymour, Graph Minors XXII. Irrelevant vertices in linkage problems, preprint, 1992.

    Google Scholar 

  9. A. Schrijver, Finding k disjoint paths in a directed planar graph, SIAM Journal on Computing, to appear.

    Google Scholar 

  10. H. Suzuki, T. Akama, and T. Nishiseki, An algorithm for finding a forest in a planar graph — case in which a net may have terminals on the two specified face boundaries (in Japanese), Denshi Joho Tsushin Gakkai Ronbunshi 71-A (1988) 1897–1905 (English translation: Electron. Comm. Japan Part III Fund. Electron. Sci. 72 (1989) 10:68–79).

    Google Scholar 

  11. D. Wagner and K. Weihe, A linear-time algorithm for edge-disjoint paths in planar graphs, preprint, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI and University, Amsterdam, The Netherlands

    Alexander Schrijver

Authors
  1. Alexander Schrijver
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Lengauer

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schrijver, A. (1993). Complexity of disjoint paths problems in planar graphs. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-57273-2_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57273-2

  • Online ISBN: 978-3-540-48032-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation