Fundamentals of Computation Theory

DOI10.1007/b11926zbMath1278.68103MaRDI QIDQ5900786

Andreas Brandstädt, Dieter Kratsch, Hans L. Bodlaender, Jeremy P. Spinrad, Michaël Rao

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11926

zbMATH Keywords

NP-complete problems; graph algorithms; modular decomposition; \((P_5, \mathrm{gem})\)-free graphs

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)