-
1
-
-
38749085661
-
Local graph partitioning using PageRank vectors
-
R. Andersen, F. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In FOCS '06, pages 475-486, 2006.
-
(2006)
FOCS '06
, pp. 475-486
-
-
Andersen, R.1
Chung, F.2
Lang, K.3
-
2
-
-
33749575022
-
Group formation in large social networks: Membership, growth, and evolution
-
L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06, pages 44-54, 2006.
-
(2006)
KDD '06
, pp. 44-54
-
-
Backstrom, L.1
Huttenlocher, D.2
Kleinberg, J.3
Lan, X.4
-
3
-
-
26244464025
-
Comparing community structure identification
-
L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification. Journal of Stat. Mech.: Theory and Experiment, 29(09):P09008, 2005.
-
(2005)
Journal of Stat. Mech.: Theory and Experiment
, vol.29
, Issue.9
, pp. 09008
-
-
Danon, L.1
Duch, J.2
Diaz-Guilera, A.3
Arenas, A.4
-
4
-
-
34548748711
-
Weighted graph cuts without eigenvectors: A multilevel approach
-
I. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on PAMI, 29(11):1944-1957, 2007.
-
(2007)
IEEE Transactions on PAMI
, vol.29
, Issue.11
, pp. 1944-1957
-
-
Dhillon, I.1
Guan, Y.2
Kulis, B.3
-
5
-
-
84925930275
-
The focused organization of social ties
-
S. L. Feld. The focused organization of social ties. American Journal of Sociology, 86(5):1015-1035, 1981.
-
(1981)
American Journal of Sociology
, vol.86
, Issue.5
, pp. 1015-1035
-
-
Feld, S.L.1
-
6
-
-
0034592749
-
Efficient identification of web communities
-
G. Flake, S. Lawrence, and C. Giles. Efficient identification of web communities. In KDD '00, pages 150-160, 2000.
-
(2000)
KDD '00
, pp. 150-160
-
-
Flake, G.1
Lawrence, S.2
Giles, C.3
-
7
-
-
74049087026
-
Community detection in graphs
-
S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
-
(2010)
Physics Reports
, vol.486
, Issue.3-5
, pp. 75-174
-
-
Fortunato, S.1
-
8
-
-
33846126275
-
Resolution limit in community detection
-
S. Fortunato and M. Barthélemy. Resolution limit in community detection. PNAS, 104(1):36-41, 2007.
-
(2007)
PNAS
, vol.104
, Issue.1
, pp. 36-41
-
-
Fortunato, S.1
Barthélemy, M.2
-
9
-
-
0037062448
-
Community structure in social and biological networks
-
M. Girvan and M. Newman. Community structure in social and biological networks. PNAS, 99(12):7821-7826, 2002.
-
(2002)
PNAS
, vol.99
, Issue.12
, pp. 7821-7826
-
-
Girvan, M.1
Newman, M.2
-
11
-
-
36348947993
-
Modularity from fluctuations in random graphs and complex networks
-
R. Guimerà, M. Sales-Pardo, and L. Amaral. Modularity from fluctuations in random graphs and complex networks. Physical Review E, 70:025101, 2004.
-
(2004)
Physical Review E
, vol.70
, pp. 025101
-
-
Guimerà, R.1
Sales-Pardo, M.2
Amaral, L.3
-
12
-
-
84863284769
-
The life and death of online groups: Predicting group growth and longevity
-
S. Kairam, D. Wang, and J. Leskovec. The life and death of online groups: Predicting group growth and longevity. In WSDM '12, 2012.
-
(2012)
WSDM '12
-
-
Kairam, S.1
Wang, D.2
Leskovec, J.3
-
13
-
-
0032131147
-
A fast and high quality multilevel scheme for partitioning irregular graphs
-
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20:359-392, 1998.
-
(1998)
SIAM Journal on Scientific Computing
, vol.20
, pp. 359-392
-
-
Karypis, G.1
Kumar, V.2
-
14
-
-
0002719797
-
The Hungarian method for the assignment problem
-
H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955.
-
(1955)
Naval Research Logistic Quarterly
, vol.2
, pp. 83-97
-
-
Kuhn, H.W.1
-
16
-
-
77954653623
-
Empirical comparison of algorithms for network community detection
-
J. Leskovec, K. Lang, and M. Mahoney. Empirical comparison of algorithms for network community detection. In WWW '10, 2010.
-
(2010)
WWW '10
-
-
Leskovec, J.1
Lang, K.2
Mahoney, M.3
-
17
-
-
84924178998
-
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
-
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6, 2009.
-
(2009)
Internet Mathematics
, vol.6
-
-
Leskovec, J.1
Lang, K.J.2
Dasgupta, A.3
Mahoney, M.W.4
-
18
-
-
42149117427
-
Measurement and analysis of online social networks
-
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC '07, pages 29-42, 2007.
-
(2007)
IMC'07
, pp. 29-42
-
-
Mislove, A.1
Marcon, M.2
Gummadi, K.P.3
Druschel, P.4
Bhattacharjee, B.5
-
19
-
-
33745012299
-
Modularity and community structure in networks
-
M. Newman. Modularity and community structure in networks. PNAS, 103(23):8577-8582, 2006.
-
(2006)
PNAS
, vol.103
, Issue.23
, pp. 8577-8582
-
-
Newman, M.1
-
20
-
-
37649028224
-
Finding and evaluating community structure in networks
-
M. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 2004.
-
(2004)
Phys. Rev. E
-
-
Newman, M.1
Girvan, M.2
-
21
-
-
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, 2005.
-
(2005)
Nature
, vol.435
, Issue.7043
, pp. 814-818
-
-
Palla, G.1
Derényi, I.2
Farkas, I.3
Vicsek, T.4
-
22
-
-
1542357701
-
Defining and identifying communities in networks
-
F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 101(9):2658-2663, 2004.
-
(2004)
PNAS
, vol.101
, Issue.9
, pp. 2658-2663
-
-
Radicchi, F.1
Castellano, C.2
Cecconi, F.3
Loreto, V.4
Parisi, D.5
-
25
-
-
4544280485
-
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
-
D. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04, pages 81-90, 2004.
-
(2004)
STOC '04
, pp. 81-90
-
-
Spielman, D.1
Teng, S.-H.2
-
26
-
-
0032482432
-
Collective dynamics of small-world networks
-
D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.
-
(1998)
Nature
, vol.393
, pp. 440-442
-
-
Watts, D.1
Strogatz, S.2
-
27
-
-
79952716571
-
An information flow model for conflict and fission in small groups
-
W. Zachary. An information flow model for conflict and fission in small groups. J. of Anthropological Research, 1977.
-
(1977)
J. of Anthropological Research
-
-
Zachary, W.1
|