Graph-based data clustering with overlaps

Michael Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann

    Research output: Contribution to journalArticle

    Abstract

    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 s. In the case of s-vertex-overlap, each vertex may be part of at most s maximal cliques; s-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 s-values) and parameterized hardness (in case of unbounded s-values).
    Original languageEnglish
    Pages (from-to)2-17
    Number of pages16
    JournalDiscrete Optimization
    Volume8
    Issue number1
    DOIs
    Publication statusPublished - 2011

      Fingerprint

    Cite this

    Fellows, M., Guo, J., Komusiewicz, C., Niedermeier, R., & Uhlmann, J. (2011). Graph-based data clustering with overlaps. Discrete Optimization, 8(1), 2-17. https://doi.org/10.1016/j.disopt.2010.09.006