Fetching the paper…
Reading the bibliography…
We introduce a novel algorithm to perform graph clustering in the edge streaming setting.
Data structures and network algorithms
R. E. Tarjan · 1983
Earlier work this paper cites.
Approximating st minimum cuts in õ (n 2) time
A. A. Benczúr and D. R. Karger · 1996
Earlier work this paper cites.
Efficient identification of web communities
G. W. Flake, S. Lawrence, and C. L. Giles · 2000
Earlier work this paper cites.
Reductions in streaming algorithms, with an application to counting triangles in graphs
Z. Bar-Yossef, R. Kumar, and D. Sivakumar · 2002
Earlier work this paper cites.
Fast algorithm for detecting community structure in networks
M. E. Newman · 2004
Earlier work this paper cites.
On graph problems in a semi-streaming model
J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang · 2005
Earlier work this paper cites.
Uncovering the overlapping community structure of complex networks in nature and society
G. Palla, I. Derényi, I. Farkas, and T. Vicsek · 2005
Earlier work this paper cites.
Computing communities in large networks using random walks
P. Pons and M. Latapy · 2005
Earlier work this paper cites.
Group formation in large social networks: membership, growth, and evolution
L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan · 2006
Earlier work this paper cites.
Counting triangles in data streams
L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler · 2006
Earlier work this paper cites.
Efficient algorithms for constructing (1+ ϵ \epsilon , β \beta )-spanners in the distributed and streaming models
M. Elkin and J. Zhang · 2006
Earlier work this paper cites.
Modularity and community structure in networks
M. E. Newman · 2006
Earlier work this paper cites.
The dynamics of viral marketing
J. Leskovec, L. A. Adamic, and B. A. Huberman · 2007
Cited alongside, same era.
Measurement and analysis of online social networks
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee · 2007
Cited alongside, same era.
Evolution and structure of the Internet: A statistical physics approach
R. Pastor-Satorras and A. Vespignani · 2007
Cited alongside, same era.
Spectral partitioning works: Planar graphs and finite element meshes
D. A. Spielman and S.-H. Teng · 2007
Cited alongside, same era.
A tutorial on spectral clustering
U. Von Luxburg · 2007
Cited alongside, same era.
Fast unfolding of communities in large networks
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre · 2008
Cited alongside, same era.
Finding statistically significant communities in networks
A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato · 2011
Later among the works it cites.
Graph sketches: sparsification, spanners, and subgraphs
K. J. Ahn, S. Guha, and A. McGregor · 2012
Later among the works it cites.
On the communication and streaming complexity of maximum bipartite matching
A. Goel, M. Kapralov, and S. Khanna · 2012
Later among the works it cites.
Overlapping community detection using seed set expansion
J. J. Whang, D. F. Gleich, and I. S. Dhillon · 2013
Later among the works it cites.
Overlapping community detection in networks: The state-of-the-art and comparative study
J. Xie, S. Kelley, and B. K. Szymanski · 2013
Later among the works it cites.
Overlapping community detection at scale: a nonnegative matrix factorization approach
J. Yang and J. Leskovec · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Maps of random walks on complex networks reveal community structure
M. Rosvall and C. T. Bergstrom · 2008
Cited alongside, same era.
Community detection algorithms: a comparative analysis
A. Lancichinetti and S. Fortunato · 2009
Cited alongside, same era.
Detecting the overlapping and hierarchical community structure in complex networks
A. Lancichinetti, S. Fortunato, and J. Kertész · 2009
Cited alongside, same era.
Patterns and dynamics of users’ behavior and interaction: Network analysis of an online community
P. Panzarasa, T. Opsahl, and K. M. Carley · 2009
Cited alongside, same era.
Community detection in graphs
S. Fortunato · 2010
Cited alongside, same era.
Statistical significance of communities in networks
A. Lancichinetti, F. Radicchi, and J. J. Ramasco · 2010
Cited alongside, same era.
Later among the works it cites.
Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach
L. Gauvin, A. Panisson, and C. Cattuto · 2014
Later among the works it cites.
Graph stream algorithms: a survey
A. McGregor · 2014
Later among the works it cites.
High quality, scalable and parallel community detection for large real graphs
A. Prat-Pérez, D. Dominguez-Sal, and J.-L. Larriba-Pey · 2014
Later among the works it cites.
Efficient densest subgraph computation in evolving graphs
A. Epasto, S. Lattanzi, and M. Sozio · 2015
Later among the works it cites.
Defining and evaluating network communities based on ground-truth
J. Yang and J. Leskovec · 2015
Later among the works it cites.