Skip to main content
SpringerLink
Log in

The k-Disjoint Paths Problem on Chordal Graphs

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5911))

Included in the following conference series:

Abstract

Algorithms based on a bottom-up traversal of a tree decomposition are used in literature to develop very efficient algorithms for graphs of bounded treewidth. However, such algorithms can also be used to efficiently solve problems on chordal graphs, which in general do not have a bounded treewidth. By combining this approach with a sparsification technique we obtain the first linear-time algorithm for chordal graphs that solves the k-disjoint paths problem. In this problem k pairs of vertices are to be connected by pairwise vertex-disjoint paths. We also present the first polynomial-time algorithm for chordal graphs capable of finding disjoint paths solving the k-disjoint paths problem with minimal total length. Finally, we prove that the version of the disjoint paths problem, where k is part of the input, is \(\mathcal{NP}\)-hard on chordal graphs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blair, J.R.S., England, R.E., Thomason, M.G.: Cliques and their separators in triangulated graphs, Tech. Report UT-CS-88-73, Dept. Comput. Sci., University of Tennessee, Knoxville (1988)

    Google Scholar 

  2. Buneman, P.: A characterisation of rigid circuit graphs. Discrete Math. 9, 205–212 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  3. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835–855 (1965)

    MATH  MathSciNet  Google Scholar 

  5. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 180–187 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B 16, 47–56 (1974)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  8. Krishnan, S.V., Pandu Rangan, C., Seshadri, S.: A new linear algorithm for the two path problem on chordal graphs. In: Kumar, S., Nori, K.V. (eds.) FSTTCS 1988. LNCS, vol. 338, pp. 49–66. Springer, Heidelberg (1988)

    Google Scholar 

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

    Article  Google Scholar 

  10. Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete and Comput. Geom. 26, 573–590 (2001)

    MATH  MathSciNet  Google Scholar 

  11. Ohtsuki, T.: The two disjoint path problem and wire routing design. In: Saito, N., Nishizeki, T. (eds.) Graph Theory and Algorithms. LNCS, vol. 108, pp. 207–216. Springer, Heidelberg (1981)

    Google Scholar 

  12. Okamoto, Y., Uno, T., Uehara, R.: Linear-time counting algorithms for independent sets in chordal graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 433–444. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Perković, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. International Journal of Foundations of Computer Science (IJFCS) 11, 365–372 (2000)

    Article  Google Scholar 

  14. Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM 25, 1–9 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  15. Roberts, F.S.: Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. Prentice Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  16. Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width, Report No. 396/1994, TU Berlin, FB Mathematik (1994)

    Google Scholar 

  17. Seymour, P.D.: Disjoint paths in graphs. Discrete Math. 29, 293–309 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  18. Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. ACM 27, 445–456 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  19. Thomassen, C.: 2-linked graphs. European J. Combin. 1, 371–378 (1980)

    MATH  MathSciNet  Google Scholar 

  20. Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J. Graph Theory 2, 265–267 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, D-86135, Augsburg, Germany

    Frank Kammer & Torsten Tholey

Authors
  1. Frank Kammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torsten Tholey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - LIRMM, 161 rue Ada, 34392, Montpellier Cedex 5, France

    Christophe Paul

  2. LIAFA, case 7014, Université Paris Diderot, 75205, Paris Cedex 13, France

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kammer, F., Tholey, T. (2010). The k-Disjoint Paths Problem on Chordal Graphs. In: Paul, C., Habib, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 2009. Lecture Notes in Computer Science, vol 5911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11409-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11409-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11408-3

  • Online ISBN: 978-3-642-11409-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation