Partial vertex cover on graphs of bounded degeneracy

DOI10.1007/978-3-031-09574-0_18OpenAlexW4285209040MaRDI QIDQ2097233

Hannane Yaghoubizade, Fahad Panolan

Publication date: 11 November 2022

Full work available at URL: https://arxiv.org/abs/2201.03876

zbMATH Keywords

planar graphsparameterized algorithmspartial vertex coverbounded degeneracy

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Implicit branching and parameterized partial cover problems
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Subexponential algorithms for partial cover problems
• Parameterized complexity of Vertex Cover variants
• Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
• (Meta) Kernelization
• Kernelization
• Lossy kernelization
• Parameterized Complexity for Domination Problems on Degenerate Graphs
• Improved Upper Bounds for Partial Vertex Cover
• Bidimensionality and Geometric Graphs
• Parameterized Algorithms

This page was built for publication: Partial vertex cover on graphs of bounded degeneracy