Vertex and edge covers with clustering properties: Complexity and algorithms

DOI10.1016/j.jda.2008.09.007zbMath1187.68342MaRDI QIDQ1026225

Henning Fernau, David F. Manlove

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.007

zbMATH Keywords

approximation algorithm; NP-completeness; polynomial-time algorithm; FPT algorithm; connected vertex cover; \(t\)-total edge cover; \(t\)-total vertex cover

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms