Advertisement

Depth-First Search and the Plehn–Voigt Theorem

  • Rodney G. Downey
  • Michael R. Fellows
Part of the Texts in Computer Science book series (TCS)

Abstract

In this chapter, we explore two methods for proving fixed-parameter tractability results based on the basic graph-theoretic algorithmic technique of depth-first search. These methods also build upon and extend the bounded-treewidth ideas of Chap.  12.

References

  1. 71.
    H. Bodlaender, On linear time minor tests and depth-first search, in Algorithms and Data Structures, Proceedings of Workshop WADS 1989, Ottawa, Canada, August 17–19, 1989, ed. by F. Dehne, J.-R. Sack, N. Santoro. LNCS, vol. 382 (Springer, Berlin, 1989), pp. 577–590 Google Scholar
  2. 72.
    H. Bodlaender, On disjoint cycles, Technical Report RUU-CS-90-29, Department of Information and Computing Sciences, Utrecht University, The Netherlands, August 1990 Google Scholar
  3. 103.
    B. Bollobiás, Extremal Graph Theory (Dover, New York, 2004) Google Scholar
  4. 237.
    R. Downey, The birth and early years of parameterized complexity, in The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, ed. by H. Bodlaender, R. Downey, F. Fomin, D. Marx. LNCS, vol. 7370 (Springer, Berlin, 2012), pp. 17–38 CrossRefGoogle Scholar
  5. 241.
    R. Downey, M. Fellows, Fixed-parameter tractability and completeness. Congr. Numer. 87, 161–178 (1992) MathSciNetGoogle Scholar
  6. 247.
    R. Downey, M. Fellows, Parameterized Complexity. Monographs in Computer Science (Springer, Berlin, 1999) CrossRefGoogle Scholar
  7. 277.
    P. Erdős, L. Pósa, On independent circuits contained in a graph. Can. J. Math. 17, 347–352 (1965) CrossRefGoogle Scholar
  8. 301.
    M. Fellows, M. Langston, On search, decision and the efficiency of polynomial time algorithms, in Proceedings of 21st ACM Symposium on Theory of Computing (STOC ’89), Seattle, Washington, USA, May 15–May 17, 1989, ed. by D. Johnson (ACM, New York, 1989), pp. 501–512. http://dl.acm.org/citation.cfm?id=73055 Google Scholar
  9. 400.
    J. Hopcroft, R. Tarjan, Efficient planarity testing. J. ACM 21(4), 549–568 (1974) MathSciNetzbMATHGoogle Scholar
  10. 479.
    M. Langston, Fixed parameter tractability, a prehistory. A Festschrift contribution devoted to Michael R. Fellows on the occasion of his 60th birthday, in The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, ed. by H. Bodlaender, R. Downey, F. Fomin, D. Marx. LNCS, vol. 7370 (Springer, Berlin, 2012), pp. 3–16 CrossRefGoogle Scholar
  11. 503.
    W. Mader, Existenz n-Fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte. Abh. Math. Semin. Univ. Hamb. 37, 86–97 (1972) MathSciNetCrossRefzbMATHGoogle Scholar
  12. 534.
    B. Monien, How to find long paths efficiently. Ann. Discrete Math. 25, 239–254 (1985) MathSciNetGoogle Scholar
  13. 562.
    J. Plehn, B. Voigt, Finding minimally weighted subgraphs, in Graph-Theoretic Concepts in Computer Science: 16th International Workshop, WG 1990, Revised Papers, Berlin, Germany, June 1990, ed. by R. Möhring. LNCS, vol. 484 (Springer, Berlin, 1990), pp. 18–29 CrossRefGoogle Scholar
  14. 636.
    R. Tarjan, Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146–160 (1972) MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Rodney G. Downey
    • 1
  • Michael R. Fellows
    • 2
  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria UniversityWellingtonNew Zealand
  2. 2.School of Engineering and Information TechnologyCharles Darwin UniversityDarwinAustralia

Personalised recommendations