Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
From MaRDI portal
Publication:3434701
DOI10.1007/11753728_28zbMath1185.05117OpenAlexW1653223661MaRDI QIDQ3434701
Stefan Richter, Daniel Mölle, 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
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Capacitated Domination and Covering: A Parameterized Perspective ⋮ Complexity and Approximation Results for the Connected Vertex Cover Problem ⋮ Fixed-parameter enumerability of cluster editing and related problems ⋮ Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs ⋮ Vertex and edge covers with clustering properties: Complexity and algorithms
This page was built for publication: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
