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