Weighted vertex cover on graphs with maximum degree 3

Research output: Working paperPreprint

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.
Original languageAmerican English
StatePublished - 2018

Fingerprint

Dive into the research topics of 'Weighted vertex cover on graphs with maximum degree 3'. Together they form a unique fingerprint.

Cite this