Skip to main content
SpringerLink
Log in

Bäume und Co-Graphen

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

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

  • 2857 Accesses

Zusammenfassung

Wie bereits in Kapitel 3 erläutert, gibt es zahlreiche spezielle Graphklassen. Lassen sich alle Graphen einer Klasse entlang einer Baumstruktur aufbauen, so spricht man von einer baumstrukturierten Graphklasse. Baumstrukturierte Graphen spielen in der Informatik eine wichtige Rolle, da eine unterliegende Baumstruktur sehr oft eine systematische und effiziente Analyse der entsprechenden Graphen ermöglicht. Voraussetzung für diese effiziente Analyse ist, dass die Baumstruktur der Graphen explizit gegeben ist bzw.

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. H. Jung. On a class of posets and the corresponding comparability graphs. Journal of Combinatorial Theory, Series B, 24:125–133, 1978.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Corneil, H. Lerchs, and L. Stewart-Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163–174, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Lerchs. On cliques and kernels. Technical report, Department of Computer Science, University of Toronto, 1971.

    Google Scholar 

  5. P. Sumner. Dacey graphs. Journal of the Australian Mathematical Society, 18:492–502, 1974.

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

Download citation

Publish with us

Policies and ethics

Search

Navigation