Graph-based data clustering with overlaps
From MaRDI portal
Publication:456688
DOI10.1016/j.disopt.2010.09.006zbMath1248.90070WikidataQ57359689 ScholiaQ57359689MaRDI QIDQ456688
Michael R. Fellows, Rolf Niedermeier, Jiong Guo, Christian Komusiewicz, Johannes Uhlmann
Publication date: 16 October 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.006
NP-hardness; fixed-parameter tractability; kernelization; \(W[1\)-hardness]; cluster graph modification problems; forbidden subgraph characterization
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems