FPT Is Characterized by Useful Obstruction Sets

DOI10.1007/978-3-642-45043-3_23zbMath1417.68051arXiv1305.3102OpenAlexW1767464984WikidataQ57359791 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Sparse obstructions for minor-covering parameters ⋮ On sparsification for computing treewidth

This page was built for publication: FPT Is Characterized by Useful Obstruction Sets