NP-hard problems in hierarchical-tree clustering
Acta Informatica
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Substitution Decomposition on Chordal Graphs and Applications
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Machine Learning
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Recognition Algorithm for Diamond-Free Graphs
Informatica
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Theory of Computing Systems
A more effective linear kernelization for cluster editing
Theoretical Computer Science
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
Editing Graphs into Disjoint Unions of Dense Clusters
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Theory of Computing Systems
A 2k Kernel for the cluster editing problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Generalized graph clustering: recognizing (p, q)-cluster graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Computer Science Review
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Parameterized Complexity
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
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).