Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms for graph partitioning on the planted partition model
Random Structures & Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Knowledge and Data Engineering
Communities in Large Networks: Identification and Ranking
Algorithms and Models for the Web-Graph
Nash Stability in Additively Separable Hedonic Games and Community Structures
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Structural inference of hierarchies in networks
ICML'06 Proceedings of the 2006 conference on Statistical network analysis
Strange bedfellows: community identification in bittorrent
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
| Hi-index | 0.00 |
Inspired by the planted l-partition model, the hierarchical random graph model and observations on real networks we define a community structure of a graph as a partition of the nodes into at least two sets with the property that each node has connections to relatively many nodes in its own set compared to any other set in the partition. We refer to the sets in such a partition as communities. We show that it is NP-hard to compute a community containing a given set of nodes. On the other hand, we show how to compute a community structure in polynomial time for any connected graph containing at least four nodes except the star graph Sn.