Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9837-y
Abstract: AbstractThe Connected Vertex Cover problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized… read more here.
Keywords: lceil frac; frac alpha; vertex cover; connected vertex ... See more keywords
Connected Vertex Cover for $$(sP_1+P_5)$$(sP1+P5)-Free Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00601-9
Abstract: The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most k that induces a connected subgraph of G. This is a well-studied problem, known to be NP-complete for restricted… read more here.
Keywords: problem; vertex cover; free graphs; connected vertex ... See more keywords