The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Journal of the ACM (JACM)
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
Theory of Computing Systems
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Incompressibility through Colors and IDs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels
Journal of Computer and System Sciences
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Chordal Deletion is Fixed-Parameter Tractable
Algorithmica
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Measuring indifference: unit interval vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized Complexity
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Obtaining planarity by contracting few edges
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Obtaining planarity by contracting few edges
Theoretical Computer Science
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
Hi-index | 0.00 |
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 the task is to determine whether we can obtain an acyclic graph or a path, respectively, by a sequence of at most k edge contractions in G. We present an algorithm with running time 4.98knO(1) for Tree Contraction, based on a variant of the color coding technique of Alon, Yuster and Zwick, and an algorithm with running time 2k+o(k)+nO(1) for Path Contraction. Furthermore, we show that Path Contraction has a kernel with at most 5k+3 vertices, while Tree Contraction does not have a polynomial kernel unless NP ⊆ coNP/poly. We find the latter result surprising, because of the connection between Tree Contraction and Feedback Vertex Set, which is known to have a kernel with 4k2 vertices.