ACM Computing Surveys (CSUR)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Machine Learning
A divide-and-merge methodology for clustering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Stochastic local clustering for massive graphs
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Proceedings of the 16th international conference on World Wide Web
COLA: optimizing stream processing applications via graph partitioning
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
COLA: optimizing stream processing applications via graph partitioning
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Record linkage with uniqueness constraints and erroneous values
Proceedings of the VLDB Endowment
Community detection in Social Media
Data Mining and Knowledge Discovery
A combinatorial model and algorithm for globally searching community structure in complex networks
Journal of Combinatorial Optimization
Dense and sparse graph partition
Discrete Applied Mathematics
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem
Computational Optimization and Applications
Graph-based Sybil detection in social and information systems
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
| Hi-index | 0.00 |
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Identifying clusters can be achieved by optimizing a fitness function that measures the quality of a cluster within the graph. Examples of such cluster measures include the conductance, the local and relative densities, and single cluster editing. We prove that the decision problems associated with the optimization tasks of finding clusters that are optimal with respect to these fitness measures are NP-complete.