Partial vertex cover on graphs of bounded degeneracy

DOI10.1007/978-3-031-09574-0_18MaRDI QIDQ2097233zbMATH OpenOpenAlexFDO

Authors Fahad Panolan, Hannane Yaghoubizade

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

• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• (Meta) kernelization
• Bidimensionality and kernels
• Efficient computation of representative families with applications in parameterized and exact algorithms
• Implicit branching and parameterized partial cover problems
• Improved Upper Bounds for Partial Vertex Cover
• Kernelization. Theory of parameterized preprocessing
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Lossy kernelization
• Parameterized Complexity for Domination Problems on Degenerate Graphs
• Parameterized algorithms
• Parameterized complexity of Vertex Cover variants
• Subexponential algorithms for partial cover problems

Cited in

(1)

• A note on the cover degeneracy of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097233)