A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
From MaRDI portal
Publication:3638452
DOI10.1007/978-3-642-02158-9_20zbMath1246.68171MaRDI QIDQ3638452
Rolf Niedermeier, Jiong Guo, Christian Komusiewicz, Johannes Uhlmann
Publication date: 2 July 2009
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_20
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)