A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
From MaRDI portal
Publication:3013154
DOI10.1137/090767285zbMath1221.05293MaRDI QIDQ3013154
Rolf Niedermeier, Jiong Guo, Christian Komusiewicz, Johannes Uhlmann
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090767285
data reduction; NP-hard problems; fixed-parameter tractability; exact algorithms; graph modification; \(k\)-plex; forbidden subgraph characterization; dense subgraphs
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W99: Algorithms in computer science