Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
From MaRDI portal
Publication:4554933
DOI10.1145/3108239zbMath1451.68137arXiv1305.4914MaRDI QIDQ4554933
Marek Cygan, Danny Hermelin, Fabrizio Grandoni
Publication date: 12 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.4914
degenerate graphs; parameterized complexity; sparse graphs; kernelization; weak compositions; kernelization lower bounds
68R10: Graph theory (including graph drawing) in computer science
68Q27: Parameterized complexity, tractability and kernelization