Skip to main content
SpringerLink
Log in

Vertex Disjoint Paths on Clique-Width Bounded Graphs

Extended Abstract

  • Conference paper
LATIN 2004: Theoretical Informatics (LATIN 2004)

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

Included in the following conference series:

Abstract

We show that l vertex disjoint paths between l pairs of vertices can be found in linear time for co-graphs but is NP-complete for graphs of NLC-width at most 4 and clique-width at most 7. This is the first inartificial graph problem known to be NP-complete on graphs of bounded clique-width but solvable in linear time on co-graphs and graphs of bounded tree-width.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 258–264. ACM, New York (2002)

    Google Scholar 

  2. Brandstädt, A., Dragan, F.F., Le, H.-O., Mosca, R.: New graph classes of bounded clique width. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 57–67. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Bodlaender, H.L.: Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees. Journal of Algorithms 11(4), 631–643 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Corneil, D.G., Habib, M., Lanlignel, J.M., Reed, B., Rotics, U.: Polynomial time recognition of clique-width at most three graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776. Springer, Heidelberg (2000)

    Google Scholar 

  5. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33(2), 125–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14(4), 926–934 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 78–90. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117–128. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Espelage, W., Gurski, F., Wanke, E.: Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications - Special Issue of JGAA on WADS 2001 7(2), 141–180 (2003)

    MATH  MathSciNet  Google Scholar 

  11. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5, 691–703 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  12. Feder, T., Motwani, R.: Clique partitions, graph compression and speeding up algorithms. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 123–133. ACM, New York (1991)

    Google Scholar 

  13. Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 135–147. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Gurski, F., Wanke, E.: The tree-width of clique-width bounded graphs without K n , n . In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol. 1928, pp. 196–205. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Johansson, Ö.: Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium 132, 39–60 (1998)

    MATH  MathSciNet  Google Scholar 

  16. Johansson, Ö.: NLC2-decomposition in polynomial time. International Journal of Foundations of Computer Science 11(3), 373–395 (2000)

    Article  MathSciNet  Google Scholar 

  17. Kobler, D., Rotics, U.: Polynomial algorithms for partitioning problems on graphs with fixed clique-width. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 468–476. ACM-SIAM (2001)

    Google Scholar 

  18. Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problems. Combinatorica 35(1), 97–107 (1995)

    MathSciNet  Google Scholar 

  19. Nishizeki, T., Vygen, J., Zhou, X.: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics 115, 177–186 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms 7, 309–322 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  21. Robertson, N., Seymour, P.D.: Graph minors XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65–110 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  22. Scheffler, P.: A practical linear time algorithm for vertex disjoint paths in graphs with bounded treewidth. Technical Report 396, Dept. of Mathematics, Technische Universität Berlin (1994)

    Google Scholar 

  23. Todinca, I.: Coloring powers of graphs of bounded clique-width. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 370–382. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Wanke, E.: k-NLC graphs and polynomial algorithms. Discr. Applied Mathematics 54, 251–266 (1994); revised version: http://www.cs.uniduesseldorf.de/~wanke

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, D-40225, Düsseldorf, Germany

    Frank Gurski & Egon Wanke

Authors
  1. Frank Gurski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rutgers University, NJ 08854, Piscataway

    Martín Farach-Colton

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurski, F., Wanke, E. (2004). Vertex Disjoint Paths on Clique-Width Bounded Graphs. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24698-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21258-4

  • Online ISBN: 978-3-540-24698-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation