[1]王力,于欣宇,李颖宏,等. 基于FCM聚类的复杂交通网络节点重要性评估[J].交通运输系统工程与信息, 2010,10(6):169-173.[WANG L, YU X Y, LI Y H,et al.Traffic complex network node importance assessment based on FCM clustering [J]. Journal of Transportation Systems Engineering and Information Technology. 2010,10(6):169-173. ]
[2]Scott J. Social networks analysis: a handbook [M]. London: Sage Publications.2000.
[3]Kernighan B W, Lin S. A efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal, 1970,49:291-307.
[4]Pothen A, Simon H, et al. Partitioning sparse matrices with eigenvectors of graphs [J]. SIAM J. Matrix Anal. Appl., 1990,11:430-452.
[5] Girvan M, Newman M E J. Community structure in social and biological networks [J]. Proc. Natl. Acad, 2002,99:7821-7826.
[6]Wu F, Huberman B A. Finding communities in linear time: A physics approach[J]. Euro. Phys.J. B,2003,38:331-338.
[7] Newman M E J,Girvan M. Finding and evaluating community structure in networks[J]. Phys. Rev. E, 2004, 69: 026113.
[8]Newman M E J. Fast algorithm for detecting community structure in networks[J]. Phys. Rev. E, 2004, 69:066133.
[9]王林,戴冠中.复杂网络的Scalefree性、Scalefree现象及其控制[M].北京:科学出版社, 2009 .[WANG L, DAI G Z. Scalefree characteristic, phenomenon and control of complex network [M]. Beijing: Science Press, 2009.] |