Skip to main content
SpringerLink
Log in
Book cover

Exakte Algorithmen für schwere Graphenprobleme pp 259–284Cite as

Baumweitebeschränkte Graphen

  • Chapter
  • First Online:

  • 2783 Accesses

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

Zusammenfassung

Nun betrachten wir Parametrisierungen, die die Weite eines Graphen messen, wenn dieser in einer speziellen Baumstruktur repräsentiert wird. Entlang dieser Baumstruktur können viele an sich schwere Probleme auf Graphen mit beschränktem Parameter effizient im Sinne von FPT-Algorithmen gelöst werden.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. T. Ito, T. Nishizeki, and X. Zhou. Algorithms for multicolorings of partial k-trees. IEICE Transactions on Information and Systems, E86-D:191–200, 2003.

    Google Scholar 

  2. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability – A survey. BIT, 25:2–23, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Rose. On simple characterizations of k-trees. Discrete Mathematics, 7:317–322, 1974.

    MATH  MathSciNet  Google Scholar 

  4. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a .k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):277–284, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Chlebikova. Partial .k-trees with maximum chromatic number. Discrete Mathematics, 259(1–3):269–276, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  6. H. Bodlaender and A. Koster. Combinatorial optimization on graphs of bounded tree-width. Computer Journal, 51(3):255–269, 2008.

    Article  MathSciNet  Google Scholar 

  7. X. Zhou, K. Fuse, and T. Nishizeki. A linear time algorithm for finding \([g,f]\)-colorings of partial k-trees. Algorithmica, 27(3):227–243, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. H. Bodlaender. A partial .k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Fomin, D. Kratsch, I. Todinca, and Y. Villanger. Exact algorithms for treewidth and minimum fill-in. SIAM Journal on Computing, 38(3):1058–1079, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  10. T. Kloks. Treewidth: Computations and Approximations. Springer-Verlag Lecture Notes in Computer Science #842, 1994.

    Google Scholar 

  11. M. Kashem, X. Zhou, and T. Nishizeki. Algorithms for generalized vertex-rankings of partial k-trees. Theoretical Computer Science, 240(2):407–427, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. H. Bodlaender. Planar graphs with bounded treewidth. Technical Report RUU-CS-88-14, Universiteit Utrecht, 1988.

    Google Scholar 

  13. H. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305–1317, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Halin. S-functions for graphs. Journal of Geometry, 8:171–176, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  15. H. Bodlaender. Classes of graphs with bounded treewidth. Technical Report RUU-CS-86-22, Universiteit Utrecht, 1986.

    Google Scholar 

  16. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial .k-trees. Discrete Applied Mathematics, 23:11–24, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  17. N. Robertson and P. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309–322, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308–340, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  19. H. Bodlaender and R. Möhring. The pathwidth and treewidth of cographs. SIAM Journal on Discrete Mathematics, 6(2):181–188, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  20. N. Robertson and P. Seymour. Graph minors X. Obstructions to tree-decompositions. Journal of Combinatorial Theory, Series B, 52:153–190, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  21. B. Courcelle. The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues. Informatique Théorique et Applications, 26:257–286, 1992.

    MATH  MathSciNet  Google Scholar 

  22. T. Hagerup. Dynamic algorithms for graphs of bounded treewidth. Algorithmica, 27(3):292–315, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  23. N. Robertson and P. Seymour. Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B, 35:39–61, 1983.

    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). Baumweitebeschränkte Graphen. In: Exakte Algorithmen für schwere Graphenprobleme. eXamen.press. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04500-4_10

Download citation

Publish with us

Policies and ethics

Search

Navigation