Minimum spanning trees for community detection

[1]  Licheng Jiao,et al.  Phase transition model for community detection , 2013 .

[2]  Maoguo Gong,et al.  Overlapping community detection via network dynamics. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Steve Gregory,et al.  Ordered community structure in networks , 2011, 1104.0923.

[4]  Santo Fortunato,et al.  Limits of modularity maximization in community detection , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Shuigeng Zhou,et al.  Evolutionary method for finding communities in bipartite networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Jiawei Han,et al.  Density-based shrinkage for revealing hierarchical and overlapping community structure in networks , 2011 .

[7]  Ernesto Estrada,et al.  Community detection based on network communicability. , 2011, Chaos.

[8]  P. Hansen,et al.  Locally optimal heuristic for modularity maximization of networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Carlo Piccardi,et al.  Communities in Italian corporate networks , 2010 .

[10]  Evolutionary method for finding communities in bipartite networks , 2010, 1011.3315.

[11]  Giuseppe Mangioni,et al.  Identifying the Community Structure of the International-Trade Multi Network , 2010, ArXiv.

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

[13]  Duoqian Miao,et al.  A graph-theoretical clustering method based on two rounds of minimum spanning trees , 2010, Pattern Recognit..

[14]  Pierre Hansen,et al.  Loops and multiple edges in modularity maximization of networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Anil K. Jain Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[17]  Yong Zhang,et al.  The detection of community structure in network via an improved spectral method , 2009 .

[18]  Zhipeng Lü,et al.  Iterated tabu search for identifying community structure in complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[20]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[22]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[23]  Ernesto Estrada,et al.  Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Jari Saramäki,et al.  Limited resolution and multiresolution methods in complex network community detection , 2007, SPIE International Symposium on Fluctuations and Noise.

[25]  N. Alves Unveiling community structures in weighted networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

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

[28]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

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

[30]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[32]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[33]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[34]  Ying Xu,et al.  Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees , 2002, Bioinform..

[35]  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.

[36]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[37]  R. Prim Shortest connection networks and some generalizations , 1957 .

[38]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .