Partial vertex cover on graphs of bounded degeneracy

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

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

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

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)