Kernel bounds for path and cycle problems
From MaRDI portal
Publication:392032
DOI10.1016/j.tcs.2012.09.006zbMath1407.68207WikidataQ59567509 ScholiaQ59567509MaRDI QIDQ392032
Hans L. Bodlaender, Stefan Kratsch, Bart M. P. Jansen
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.006
upper bounds; graphs; lower bounds; parameterized complexity; kernelization; path and cycle problems
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
