Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
DOI10.1016/J.TCS.2012.05.031zbMATH Open1247.68110OpenAlexW2129208193MaRDI QIDQ714786FDOQ714786
Peter Damaschke, Leonid Molokov
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.031
Recommendations
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
- Kernelization and parameterized complexity of star editing and union editing
- Complexity and parameterized algorithms for cograph editing
- Cograph editing: complexity and parameterized algorithms
- Alternative parameterizations for cluster editing
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Parameterized complexity of Vertex Cover variants
- Improved Upper Bounds for Partial Vertex Cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved upper bounds for vertex cover
- An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications
- Parameterized Algorithms for Generalized Domination
- Nondeterminism within $P^ * $
- Vertex and edge covers with clustering properties: Complexity and algorithms
- The union of minimal hitting sets: parameterized combinatorial bounds and counting
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
Cited In (2)
This page was built for publication: Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714786)
