NP-hard problems in hierarchical-tree clustering
Acta Informatica
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
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)
Recognition Algorithm for Diamond-Free Graphs
Informatica
Going Weighted: Parameterized Algorithms for Cluster Editing
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
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
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Theory of Computing Systems
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
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
Generalized graph clustering: recognizing (p, q)-cluster graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Multi-agent based middleware for protecting privacy in IPTV content recommender services
Multimedia Tools and Applications
Hi-index | 0.00 |
We introduce overlap cluster graph modification problems where, other than in most previous work, 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 (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 complete complexity dichotomy (polynomial-time solvable vs NP-complete) 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 results (in case of constant s -values) and parameterized hardness (in case of unbounded s -values).