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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete optimization Ročník 8; číslo 1; s. 2 - 17
Hlavní autoři:	Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.02.2011
Témata:	[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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!