Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion

DOI10.1007/s00453-011-9492-7zbMath1236.68100MaRDI QIDQ2429325

Rolf Niedermeier, René van Bevern, Hannes Moser

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9492-7

zbMATH Keywords

fixed-parameter tractability; polynomial-time data reduction; NP-hard graph problem; computational intractability; graph-based data clustering

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