Weighted vertex cover on graphs with maximum degree 3
classification
💻 cs.DS
keywords
coververtexdegreegraphsmaximumweightedalgorithmcomplexity
read the original abstract
We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is $O^*(1.402^t)$, where $t$ is the minimum size of a vertex cover of the input graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.