Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs
From MaRDI portal
Publication:2904571
DOI10.1007/978-3-642-31155-0_32zbMath1357.68073OpenAlexW72161672MaRDI QIDQ2904571
Stefan Kratsch, Venkatesh Raman, Marcin Pilipczuk, 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
FPT is characterized by useful obstruction sets ⋮ Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs
This page was built for publication: Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs
