Skip to main content
SpringerLink
Log in

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2001)

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

Included in the following conference series:

Abstract

We show that many non-MSO1 NP-hard graph problems can be solved in polynomial time on clique-width and NLC-width bounded graphs using a very general and simple scheme. Our examples are partition into cliques, partition into triangles, partition into complete bipartite subgraphs, partition into perfect matchings, partition into forests, cubic subgraph, Hamiltonian path, minimum maximal matching, and vertex/edge separation problems.

The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-1.

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. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, and U. Rotics. Polynomial time recognition of clique-width at most three graphs. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN’ 2000), volume 1776 of LNCS. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  2. B. Courcelle, J.A. Makowsky, and U. Rotics. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. D.G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. In Proceedings of Graph-Theoretical Concepts in Computer Science, LNCS, Springer-Verlag, 2001. to appear

    Google Scholar 

  6. M.C. Golumbic and U. Rotics. On the clique-width of perfect graph classes. IJFCS: International Journal of Foundations of Computer Science, 11(3):423–443, 2000.

    Article  MathSciNet  Google Scholar 

  7. F. Gurski and E. Wanke. The tree-width of clique-width bounded graphs without K n,n. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1938 of LNCS, pages 196–205. Springer-Verlag, 2000.

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  9. Ö. Johansson. NLC2 decomposition in polynomial time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1665 of LNCS, pages 110–121. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  10. D. Kobler and U. Rotics. Polynomial algorithms for partitioning problems on graphs with fixed clique-width. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 468–476 ACM-SIAM, 2001.

    Google Scholar 

  11. E. Wanke. k-NLC graphs and polynomial algorithms. Discrete 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

    Wolfgang Espelage, Frank Gurski & Egon Wanke

Authors
  1. Wolfgang Espelage
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Gurski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. 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, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Espelage, W., Gurski, F., Wanke, E. (2001). How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation