A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

DOI10.1007/978-3-642-03816-7_28zbMath1250.68125WikidataQ57359771 ScholiaQ57359771MaRDI QIDQ5895104

Michael R. Fellows, Rolf Niedermeier, Jiong Guo, Hannes Moser

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_28

Mathematics Subject Classification ID

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.)