Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
From MaRDI portal
Publication:4899241
DOI10.1007/978-3-642-33293-7_8zbMath1375.68069arXiv1207.4681OpenAlexW1784081369MaRDI QIDQ4899241
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4681
Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
A \(13k\)-kernel for planar feedback vertex set via region decomposition ⋮ Combinatorics for smaller kernels: the differential of a graph
This page was built for publication: Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
