Tight Kernel Bounds for Problems on Graphs with Small Degeneracy

DOI10.1007/978-3-642-40450-4_31zbMath1394.68173OpenAlexW2750749068MaRDI QIDQ2849328

Danny Hermelin, Fabrizio Grandoni, Marek Cygan

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_31

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

Sparsification upper and lower bounds for graph problems and not-all-equal SAT ⋮ Independent dominating set problem revisited ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ On sparsification for computing treewidth

This page was built for publication: Tight Kernel Bounds for Problems on Graphs with Small Degeneracy