Parameterized Graph Cleaning Problems

DOI10.1007/978-3-540-92248-3_26zbMath1202.05088MaRDI QIDQ5302063

Dániel Marx, Ildikó Schlotter

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.7344

zbMATH Keywords

fixed parameter tractability; induced subgraph isomorphism problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)