Fixed-parameter algorithms for cluster vertex deletion

DOI10.1007/s00224-008-9150-xzbMath1205.68263MaRDI QIDQ987386

Rolf Niedermeier, Christian Komusiewicz, Hannes Moser, Falk Hüffner

Publication date: 13 August 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9150-x

zbMATH Keywords

clustering; graph algorithms; NP-hard problems; parameterized complexity; iterative compression

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

05C85: Graph algorithms (graph-theoretic aspects)