-
1
-
-
34247133104
-
Detecting complex network modularity by dynamical clustering
-
S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino, and A. Rapisarda. Detecting complex network modularity by dynamical clustering. Phys Rev E Stat Nonlin Soft Matter Phys, 75(4), 2007.
-
(2007)
Phys Rev E Stat Nonlin Soft Matter Phys
, vol.75
, Issue.4
-
-
Boccaletti, S.1
Ivanchenko, M.2
Latora, V.3
Pluchino, A.4
Rapisarda, A.5
-
2
-
-
18144376333
-
Detecting communities in large networks
-
July
-
A. Capocci, V. D. P. Servedio, G. Caldarelli, and F. Colaiori. Detecting communities in large networks. Physica A: Statistical and Theoretical Physics, 352(2-4):669-676, July 2005.
-
(2005)
Physica A: Statistical and Theoretical Physics
, vol.352
, Issue.2-4
, pp. 669-676
-
-
Capocci, A.1
Servedio, V.D.P.2
Caldarelli, G.3
Colaiori, F.4
-
3
-
-
41349117788
-
Finding community structure in very large networks
-
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
-
(2004)
Physical Review E
, vol.70
, pp. 066111
-
-
Clauset, A.1
Newman, M.E.J.2
Moore, C.3
-
5
-
-
27244441304
-
Community detection in complex networks using extremal optimization
-
J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72:027104, 2005.
-
(2005)
Physical Review E
, vol.72
, pp. 027104
-
-
Duch, J.1
Arenas, A.2
-
7
-
-
41349119161
-
Method to find community structures based on information centrality
-
Nov
-
S. Fortunato, V. Latora, and M. Marchiori. Method to find community structures based on information centrality. Phys. Rev. E, 70(5):056104, Nov 2004.
-
(2004)
Phys. Rev. E
, vol.70
, Issue.5
, pp. 056104
-
-
Fortunato, S.1
Latora, V.2
Marchiori, M.3
-
8
-
-
0037062448
-
Community structure in social and biological networks
-
June
-
M. Girvan and M. E. Newman. Community structure in social and biological networks. Proc Natl Acad Sci U S A, 99(12):7821-7826, June 2002.
-
(2002)
Proc Natl Acad Sci U S A
, vol.99
, Issue.12
, pp. 7821-7826
-
-
Girvan, M.1
Newman, M.E.2
-
9
-
-
36348947993
-
Modularity from fluctuations in random graphs and complex networks
-
Aug
-
R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral. Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E, 70(2):025101, Aug 2004.
-
(2004)
Phys. Rev. E
, vol.70
, Issue.2
, pp. 025101
-
-
Guimerà, R.1
Sales-Pardo, M.2
Amaral, L.A.N.3
-
10
-
-
84990479742
-
An efficient heuristic procedure for partitioning graphs
-
B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, 49(1):291-307, 1970.
-
(1970)
The Bell system technical journal
, vol.49
, Issue.1
, pp. 291-307
-
-
Kernighan, B.W.1
Lin, S.2
-
11
-
-
42749100809
-
Fast algorithm for detecting community structure in networks
-
M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys Rev E Stat Nonlin Soft Matter Phys, 69(6), 2004.
-
(2004)
Phys Rev E Stat Nonlin Soft Matter Phys
, vol.69
, Issue.6
-
-
Newman, M.E.J.1
-
12
-
-
33749468596
-
Finding community structure in networks using the eigenvectors of matrices
-
M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys Rev E Stat Nonlin Soft Matter Phys, 74(3), 2006.
-
(2006)
Phys Rev E Stat Nonlin Soft Matter Phys
, vol.74
, Issue.3
-
-
Newman, M.E.J.1
-
13
-
-
37649028224
-
Finding and evaluating community structure in networks
-
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.
-
(2004)
Physical Review E
, vol.69
, pp. 026113
-
-
Newman, M.E.J.1
Girvan, M.2
-
14
-
-
20444504323
-
Uncovering the overlapping community structure of complex networks in nature and society
-
G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814-818.
-
Nature
, vol.435
, Issue.7043
, pp. 814-818
-
-
Palla, G.1
Derényi, I.2
Farkas, I.3
Vicsek, T.4
-
15
-
-
32344444324
-
On mining cross-graph quasi-cliques
-
New York, NY, USA, ACM
-
J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pages 228-238, New York, NY, USA, 2005. ACM.
-
(2005)
Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining
, pp. 228-238
-
-
Pei, J.1
Jiang, D.2
Zhang, A.3
-
16
-
-
38849162343
-
Computing communities in large networks using random walks
-
Dec
-
P. Pons and M. Latapy. Computing communities in large networks using random walks. Journal of Graph Algorithms and Applications, 10(2):191-218, Dec 2006.
-
(2006)
Journal of Graph Algorithms and Applications
, vol.10
, Issue.2
, pp. 191-218
-
-
Pons, P.1
Latapy, M.2
-
17
-
-
1542357701
-
Defining and identifying communities in networks
-
F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. In Proceedings of the National Academy of Science of the United States of America, volume 101-9, pages 2658-2663, 2004.
-
(2004)
Proceedings of the National Academy of Science of the United States of America
, vol.101 -9
, pp. 2658-2663
-
-
Radicchi, F.1
Castellano, C.2
Cecconi, F.3
Loreto, V.4
Parisi, D.5
-
19
-
-
70350685920
-
-
Wikipedia. Bulk synchronous parallel - wikipedia, the free encyclopedia, 2008. [Online; accessed 23-December-2008].
-
Wikipedia. Bulk synchronous parallel - wikipedia, the free encyclopedia, 2008. [Online; accessed 23-December-2008].
-
-
-
-
20
-
-
34547455408
-
Out-of-core coherent closed quasi-clique mining from large dense graph databases
-
Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans. Database Syst., 32(2):13, 2007.
-
(2007)
ACM Trans. Database Syst
, vol.32
, Issue.2
, pp. 13
-
-
Zeng, Z.1
Wang, J.2
Zhou, L.3
Karypis, G.4
|