Cleaning interval graphs

DOI10.1007/s00453-011-9588-0zbMath1259.68082arXiv1003.1260MaRDI QIDQ1939654

Dániel Marx, Ildikó Schlotter

Publication date: 5 March 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.1260

zbMATH Keywords

interval graphs; parameterized complexity; induced subgraph isomorphism

Mathematics Subject Classification ID

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

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