Graph-based data clustering with overlaps

We introduce overlap cluster graph modification problems where, other than in most previous works, the clusters of the target graph may overlap. More precisely, the studied graph problems ask for a minimum number of edge modifications such that the resulting graph consists of clusters (that is, maxi...

Full description

Bibliographic Details

Published in:	Discrete optimization Vol. 8; no. 1; pp. 2 - 17
Main Authors:	Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2011
Subjects:	[formula omitted]-hardness Cluster graph modification problems Fixed-parameter tractability Forbidden subgraph characterization Kernelization NP-hardness NP-hardness Forbidden subgraph characterization W -hardness Fixed-parameter tractability Cluster graph modification problems Kernelization
ISSN:	1572-5286, 1873-636X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!