Contracting Graphs to Paths and Trees

  title={Contracting Graphs to Paths and Trees},
  author={Pinar Heggernes and Pim van 't Hof and Benjamin L{\'e}v{\^e}que and Daniel Lokshtanov and Christophe Paul},
Vertex deletion and edge deletion problems play a central role in parameterized complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and Chordal Deletion. The study of analogous edge contraction problems has so far been left largely unexplored from a parameterized perspective. We consider two basic problems of this type: Tree Contraction and Path Contraction. These two problems take as input an undirected graph G on n vertices and an integer k, and… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 51 references

Contracting graphs to paths and trees

  • P. Heggernes, P. van ’t Hof, B. Lévêque, D. Lokshtanov, C. Paul
  • Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS…
  • 2012

17 th International Conference on Principles and Practice of Constraint Programming , CP

  • J. H. M. Lee
  • Lecture Notes in Computer Science
  • 2011

A 4 k 2 kernel for feedback vertex set

  • S. Thomassé
  • Lecture Notes in Computer Science
  • 2011

Similar Papers

Loading similar papers…