FPT Is Characterized by Useful Obstruction Sets
From MaRDI portal
Publication:2864307
DOI10.1007/978-3-642-45043-3_23zbMath1417.68051arXiv1305.3102WikidataQ57359791 ScholiaQ57359791MaRDI QIDQ2864307
Michael R. Fellows, Bart M. P. Jansen
Publication date: 6 December 2013
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.3102
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)