Skip to main content
SpringerLink
Log in

Fest-Parameter-Algorithmen für ausgewählte Graphenprobleme

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

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

  • 2815 Accesses

Zusammenfassung

In den Abschnitten 3.4 und 5.1 wurden einige Probleme vorgestellt, die NP-vollständig oder NP-hart sind, die sich also nicht in Polynomialzeit lösen lassen, außer wenn die für unwahrscheinlich gehaltene Gleichheit P = NP gelten würde. Dazu gehören auch viele wichtige Graphenprobleme, wie zum Beispiel die in Abschnitt 3.4 definierten NP-vollständigen Probleme Unabhängige Menge, Knotenüberdeckung, Partition in k unabhängige Mengen (auch bekannt als k-Färbbarkeit, siehe Satz 5.26), Partition in Cliquen, Dominierende Menge, Domatische Zahl und das Traveling Salesperson Problem sowie das NP-harte Unique Optimal Traveling Salesperson Problem, für das Papadimitriou [Pap84] zeigte, dass es vollständig für die Komplexitätsklasse PNP ist.

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. J. Flum and M. Grohe. Parameterized Complexity Theory. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2006.

    Google Scholar 

  2. G. Gutin and A. Yeo. Some parameterized problems on digraphs. Computer Journal, 51(3):363–371, 2008.

    Article  Google Scholar 

  3. L. Cai. Parameterized complexity of cardinality constrained optimization problems. Computer Journal, 51(1):102–121, 2008.

    Article  Google Scholar 

  4. J. Chen and J. Meng. On parameterized intractability: Hardness and completeness. Computer Journal, 51(1):39–59, 2008.

    Article  Google Scholar 

  5. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171–176, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.

    Google Scholar 

  7. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.

    Google Scholar 

  8. J. Gramm, A. Nickelsen, and T. Tantau. Fixed-parameter algorithms in phylogenetics. Computer Journal, 51(1):79–101, 2008.

    Article  Google Scholar 

  9. C. Sloper and J. Telle. An overview of techniques for designing parameterized algorithms. Computer Journal, 51(1):122–136, 2008.

    Article  Google Scholar 

  10. D. Marx. Parameterized complexity and approximation algorithms. Computer Journal, 51(1):60–78, 2008.

    Article  Google Scholar 

  11. C. Papadimitriou. On the complexity of unique solutions. Journal of the ACM, 31(2):392–400, 1984.

    Article  MathSciNet  Google Scholar 

  12. J. Chen, I. Kanj, and G. Xia. Improved parameterized upper bounds for vertex cover. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, pages 238–249. Springer-Verlag Lecture Notes in Computer Science #4162, August/September 2006.

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

Download citation

Publish with us

Policies and ethics

Search

Navigation