Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks

[1]  Lotfi Ben Romdhane,et al.  An efficient algorithm for community mining with overlap in social networks , 2014, Expert Syst. Appl..

[2]  Ulrik Brandes,et al.  Biological Networks , 2013, Handbook of Graph Drawing and Visualization.

[3]  Leonidas S. Pitsoulis,et al.  Community detection by modularity maximization using GRASP with path relinking , 2013, Comput. Oper. Res..

[4]  Jianzhong Li,et al.  Efficient community detection with additive constrains on large networks , 2013, Knowl. Based Syst..

[5]  Bin Wu,et al.  A link clustering based overlapping community detection algorithm , 2013, Data Knowl. Eng..

[6]  Rolf T. Wigand,et al.  Community Detection in Complex Networks: Multi-objective Enhanced Firefly Algorithm , 2013, Knowl. Based Syst..

[7]  Xuyang Lou,et al.  Finding communities in weighted networks through synchronization. , 2011, Chaos.

[8]  Ali A Hakami Zanjani,et al.  Finding communities in linear time by developing the seeds. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Duanbing Chen,et al.  Detecting overlapping communities of weighted networks via a local algorithm , 2010 .

[10]  Nitesh V. Chawla,et al.  Identifying and evaluating community structure in complex networks , 2010, Pattern Recognit. Lett..

[11]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[12]  Chen Wang,et al.  Detecting Overlapping Community Structures in Networks , 2009, World Wide Web.

[13]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[14]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[15]  J. Reichardt,et al.  Structure in Complex Networks , 2008 .

[16]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[17]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[19]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[20]  Guido Caldarelli,et al.  Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science , 2007 .

[21]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  M. Newman.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  M. Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  K. Sneppen,et al.  Modularity and extreme edges of the internet. , 2002, Physical review letters.

[27]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[29]  John Scott.  Social Network Analysis , 1988 .

[30]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[31]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[32]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[33]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[34]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..