共 10 条
[1]
A efficient heuristic procedure for partitioning graphs. B. W. Kernighan,,S. Lin. Bell System Technical Journal . 1970
[2]
Iden-tification of overlapping community structure in complexnetworks using fuzzyc-means clustering. Zhang Shi-hua,,Wang Rui-sheng,Zhang Xiang-sun. Physica A Statistical Mechanics and its Applications . 2007
[3]
An algorithm to find overlapping communi-ty structure in networks. Steve Gregory. Proceedings of the 11thEuropean Conference on Principles and Practice of Know-ledge Discovery in Databases . 2007
[4]
Email as spectrosco-py:automated discovery of community structure within or-ganizations. Tyler J,,Wilkinson D,Huberman B. Proceedings of International Conferenceon Communities and Technologies . 2003
[5]
Finding and evaluating com-munity structure in networks. Newman M E J,Girvan M. Physical Review E Statistical Nonlinear and Soft Matter Physics . 2004
[6]
Finding community structure in very large networks. A. Clauset,,M.E.J. Newman,,C. Moore. Phys Rev E . 2004
[7]
Partitioningsparse matriceswith eigenvectors of graphs. Pothen A,Simon H,Liou K-P. SIAM Journal on Matrix Analysis and Applications . 1990
[8]
Algebraic connectivity of graphs. Fiedler M. CzechMath J . 1973
[9]
Uncovering the overlap-ping community structure of complex networksin nature and soci-ety. Palla1G,Derenyi I,Farkas1I,et al. Nature . 2005
[10]
Fast algorithmfor detecting community struc-ture in networks. Newman M E J. Physical Review . 2004