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