Parameterized graph cleaning problems

DOI10.1016/j.dam.2009.06.022zbMath1209.05248MaRDI QIDQ967382

Dániel Marx, Ildikó Schlotter

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.022

zbMATH Keywords

graph algorithm; fixed-parameter tractability; induced subgraph isomorphism

Mathematics Subject Classification ID

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)

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