کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141530 | 957018 | 2011 | 16 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Graph-based data clustering with overlaps Graph-based data clustering with overlaps](/preview/png/1141530.png)
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, maximal cliques) that may overlap up to a certain amount specified by the overlap number ss. In the case of ss-vertex-overlap , each vertex may be part of at most ss maximal cliques; ss-edge-overlap is analogously defined in terms of edges. We provide a complexity dichotomy (polynomial-time solvable versus NP-hard) for the underlying edge modification problems, develop forbidden subgraph characterizations of “cluster graphs with overlaps”, and study the parameterized complexity in terms of the number of allowed edge modifications, achieving fixed-parameter tractability (in case of constant ss-values) and parameterized hardness (in case of unbounded ss-values).
Journal: Discrete Optimization - Volume 8, Issue 1, February 2011, Pages 2–17