Skip to main content
SpringerLink
Log in

Cliquenweitebeschränkte Graphen

  • Chapter
  • First Online:
Exakte Algorithmen für schwere Graphenprobleme

Part of the book series: eXamen.press ((EXAMEN))

  • 2795 Accesses

Zusammenfassung

In diesem Kapitel werden wir einen zweiten Ansatz zur Lösung schwieriger Graphenprobleme auf speziellen Baumstrukturen kennen lernen. Im Gegensatz zum Ansatz über die Baumweite wird es im folgenden Ansatz auch möglich sein, im Sinne der Fest-Parameter-Algorithmik solche Instanzen effizient zu lösen, die beliebig dichte Graphen (z. B. vollständige Graphen oder vollständig bipartite Graphen) enthalten. Dazu werden wir den Graphparameter Cliquenweite und seinen algorithmischen Nutzen vorstellen.

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 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.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.

Literaturverzeichnis

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

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  3. H.Müller and R. Urner. On a disparity between relative cliquewidth and relative NLC-width. Discrete Applied Mathematics, 158(7):828–840, 2010.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Gurski and E. Wanke. On the relationship between NLC-width and linear NLC-width. Theoretical Computer Science, 347(1–2):76–89, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251–266, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Gurski and E. Wanke. The tree-width of clique-width bounded graphs without \({K}_{n,n}\). In Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 196–205. Springer-Verlag Lecture Notes in Computer Science #1938, June 2000.

    Google Scholar 

  7. A. Brandstädt, J. Engelfriet, H. Le, and V. Lozin. Clique-width for four-vertex forbidden subgraphs. Theory of Computing Systems, 39(4):561–590, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Bui-Xuan, J. Telle, and M. Vatshelle. Boolean-width of graphs. In Proceedings of the 4th International Workshop on Parameterized and Exact Computation, pages 61–74. Springer-Verlag Lecture Notes in Computer Science #5917, September 2009.

    Google Scholar 

  9. B. Courcelle, J. 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 

  10. A. Brandstädt, F. Dragan, H. Le, and R. Mosca. New graph classes of bounded clique width. Theory of Computing Systems, 38(5):623–645, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  11. V. Lozin and D. Rautenbach. On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM Journal on Discrete Mathematics, 18(1):195–206, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  12. S. Oum. Approximating rank-width and clique-width quickly. ACM Transactions on Algorithms, 5(1):1–20, 2008.

    Article  MathSciNet  Google Scholar 

  13. F. Fomin, P. Golovach, D. Lokshtanov, and S. Saurabh. Clique-width: On the price of generality. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 825–834. Society for Industrial and Applied Mathematics, January 2009.

    Google Scholar 

  14. P. Hlinený, S. Oum, D. Seese, and G. Gottlob. Width parameters beyond tree-width and their applications. Computer Journal, 51(3):326–362, 2008.

    Article  Google Scholar 

  15. D. Kobler and U. Rotics. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics, 126(2–3):197–221, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  16. W. Espelage, F. Gurski, and E. Wanke. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 117–128. Springer-Verlag Lecture Notes in Computer Science #2204, June 2001.

    Google Scholar 

  17. M. Fellows, F. Rosamond, U. Rotics, and S. Szeider. Clique-width minimization is NP-hard. In Proceedings of the 38th ACM Symposium on Theory of Computing, pages 354–362. ACM Press, May 2006.

    Google Scholar 

  18. M. Gerber and D. Kobler. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoretical Computer Science, 299(1–3):719–734, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  19. 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 

  20. M. Kaminski, V. Lozin, and M. Milanic. Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics, 157(12):2747–2761, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  21. D. Corneil and U. Rotics. On the relationship between clique-width and treewidth. SIAM Journal on Computing, 4:825–847, 2005.

    Article  MathSciNet  Google Scholar 

  22. M. Rao. Clique-width of graphs defined by one-vertex extensions. Discrete Mathematics, 308(24):6157–6165, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  23. F. Gurski and E. Wanke. Vertex disjoint paths on clique-width bounded graphs. Theoretical Computer Science, 359(1–3):188–199, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  24. S. Oum and P. Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B, 96(4):514–528, 2006.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Universitätsstr. 1, 40225, Düsseldorf, Deutschland

    Priv.-Doz. Dr. Frank Gurski, Prof. Dr. Jörg Rothe & Prof. Dr. Egon Wanke

  2. Fachbereich für Maschinenbau Elektrotechnik und Technikjournalismus, Hochschule Bonn-Rhein-Sieg, 53754, Sankt Augustin, Deutschland

    Prof. Dr. Irene Rothe

Authors
  1. Priv.-Doz. Dr. Frank Gurski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prof. Dr. Irene Rothe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prof. Dr. Jörg Rothe
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prof. Dr. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Gurski .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gurski, F., Rothe, I., Rothe, J., Wanke, E. (2010). Cliquenweitebeschränkte Graphen. In: Exakte Algorithmen für schwere Graphenprobleme. eXamen.press. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04500-4_11

Download citation

Publish with us

Policies and ethics

Search

Navigation