Weighted vertex cover on graphs with maximum degree 3
Abstract
We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is O*(1.402t), where t is the minimum size of a vertex cover of the input graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.