Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs

From MaRDI portal
Publication:2904571


DOI10.1007/978-3-642-31155-0_32zbMath1357.68073MaRDI QIDQ2904571

Marcin Pilipczuk, Stefan Kratsch, Venkatesh Raman, Ashutosh Rai

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_32


68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)