Weighted vertex cover on graphs with maximum degree 3
Dekel Tsur

TL;DR
This paper presents a parameterized algorithm for the weighted vertex cover problem on graphs with maximum degree 3, achieving a time complexity of O*(1.402^t), where t is the size of the minimum vertex cover.
Contribution
The paper introduces a new parameterized algorithm with improved exponential time complexity for weighted vertex cover on degree-3 graphs.
Findings
Algorithm runs in O*(1.402^t) time
Effective for graphs with maximum degree 3
Advances parameterized complexity for vertex cover
Abstract
We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is , where is the minimum size of a vertex cover of the input graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Nuclear Receptors and Signaling · Graph Labeling and Dimension Problems
