Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
DOI10.1007/11753728_28zbMATH Open1185.05117OpenAlexW1653223661MaRDI QIDQ3434701FDOQ3434701
Authors: Daniel Mölle, Stefan Richter, Peter Rossmanith 
Publication date: 2 May 2007
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11753728_28
Recommendations
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
- Deterministic parameterized connected vertex cover
- Improved upper bounds for vertex cover
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (8)
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Fixed-parameter enumerability of cluster editing and related problems
- Capacitated Domination and Covering: A Parameterized Perspective
- Complexity and Approximation Results for the Connected Vertex Cover Problem
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Deterministic parameterized connected vertex cover
This page was built for publication: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434701)
