Fetching the paper…
Reading the bibliography…
A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph.
A method for detecting structure in sociometric data
P. W. Holland and S. Leinhardt · 1970
Earlier work this paper cites.
Finding a minimum circuit in a graph
A. Ital and M. Rodeh · 1978
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
N. Chiba and T. Nishizeki · 1985
Earlier work this paper cites.
Social capital in the creation of human capital
J. S. Coleman · 1988
Earlier work this paper cites.
Finding and counting given length cycles
N. Alon, R. Yuster, and U. Zwick · 1997
Earlier work this paper cites.
Social capital: Its origins and applications in modern sociology
A. Portes · 1998
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.
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
J.-P. Eckmann and E. Moses · 2002
Earlier work this paper cites.
Network motifs: Simple building blocks of complex networks
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon · 2002
Earlier work this paper cites.
Structural holes and good ideas
R. S. Burt · 2004
Earlier work this paper cites.
New streaming algorithms for counting triangles in graphs
H. Jowhari and M. Ghodsi · 2005
Earlier work this paper cites.
Approximating clustering coefficient and transitivity
T. Schank and D. Wagner · 2005
Earlier work this paper cites.
Finding, counting and listing all triangles in large graphs, an experimental study
T. Schank and D. Wagner · 2005
Earlier work this paper cites.
Counting triangles in data streams
L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler · 2006
Cited alongside, same era.
Sums of independent random variables with unbounded variance and estimating the average degree in a graph
U. Feige · 2006
Cited alongside, same era.
Efficient semi-streaming algorithms for local triangle counting in massive graphs
L. Becchetti, P. Boldi, C. Castillo, and A. Gionis · 2008
Cited alongside, same era.
Approximating average parameters of graphs
O. Goldreich and D. Ron · 2008
Cited alongside, same era.
Fast counting of triangles in large real networks without counting: Algorithms and laws
C. Tsourakakis · 2008
Cited alongside, same era.
Doulion: counting triangles in massive graphs with a coin
C. Tsourakakis, U. Kang, G. Miller, and C. Faloutsos · 2009
Triangle sparsifiers
C. Tsourakakis, M. N. Kolountzakis, and G. Miller · 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.
Patric: A parallel algorithm for counting triangles and computing clustering coefficients in massive networks
S. M. Arifuzzaman, M. Khan, and M. Marathe · 2012
Later among the works it cites.
Counting arbitrary subgraphs in data streams
D. M. Kane, K. Mehlhorn, T. Sauerwald, and H. Sun · 2012
Later among the works it cites.
Community structure and scale-free collections of Erdös-Rényi graphs
C. Seshadhri, T. G. Kolda, and A. Pinar · 2012
Later among the works it cites.
A space efficient streaming algorithm for triangle counting using the birthday paradox
M. Jha, C. Seshadhri, and A. Pinar · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Counting triangles in large graphs using randomized matrix trace estimation
H. Avron · 2010
Cited alongside, same era.
Efficient triangle counting in large graphs via degree-based vertex partitioning
M. N. Kolountzakis, G. L. Miller, R. Peng, and C. Tsourakakis · 2010
Cited alongside, same era.
Is a friend a friend?: Investigating the structure of friendship networks in virtual worlds
B. F. Welles, A. Van Devender, and N. Contractor · 2010
Cited alongside, same era.
Tolerating the Community Detection Resolution Limit with Edge Weighting
J. W. Berry, B. Hendrickson, R. A. LaViolette, and C. A. Phillips · 2011
Cited alongside, same era.
Triangle listing in massive networks and its applications
S. Chu and J. Cheng · 2011
Cited alongside, same era.
Counting stars and other small subgraphs in sublinear-time
M. Gonen, D. Ron, and Y. Shavitt · 2011
Cited alongside, same era.
Later among the works it cites.
Counting and sampling triangles from a graph stream
A. Pavan, K. Tangwongsan, S. Tirthapura, and K.-L. Wu · 2013
Later among the works it cites.
Fast triangle counting through wedge sampling
C. Seshadhri, A. Pinar, and T. G. Kolda · 2013
Later among the works it cites.
Parallel triangle counting in massive streaming graphs
K. Tangwongsan, A. Pavan, and S. Tirthapura · 2013
Later among the works it cites.
Graph sample and hold: A framework for big graph analytics
N. K. Ahmed, N. Duffield, J. Neville, and R. Kompella · 2014
Later among the works it cites.
Listing triangles
A. Björklund, R. Pagh, V. Vassilevska Williams, and U. Zwick · 2014
Later among the works it cites.
Approximately counting triangles in sublinear time
T. Eden, A. Levi, and D. Ron · 2015
Closest in time.