Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
triangle counting
Description:
A graph-analysis problem that counts groups of three mutually connected vertices in a network.
Primary topic:
Graph Theory and Algorithms (51%)
Related topics:
Graph Theory and Algorithms (51%),
Complexity and Algorithms in Graphs (10%),
Complex Network Analysis Techniques (8%)
OpenAlex ID:
keywords/triangle-counting
Main-memory triangle computations for very large (sparse (power-law)) graphs
2008
·
Matthieu Latapy
·
Theoretical Computer Science
·
458
PDF
Counting triangles and the curse of the last reducer
2011
·
Siddharth Suri
, Sergei Vassilvitskii
·
International World Wide Web Conference (WWW)
·
410
Reductions in streaming algorithms, with an application to counting triangles in graphs
2002
·
Ziv Bar-Yossef
, Ravi Kumar
, et al.
·
329
DOULION
2009
·
Charalampos E. Tsourakakis
, U. Kang
, et al.
·
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
·
328
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
2005
·
Thomas Schank
, Dorothea Wagner
·
Lecture notes in computer science
·
324
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
2008
·
Charalampos E. Tsourakakis
·
Proceedings
·
266
Counting triangles in data streams
2006
·
Luciana S. Buriol
, Gereon Frahling
, et al.
·
ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)
·
254
Counting and sampling triangles from a graph stream
2013
·
A. Pavan
, Kanat Tangwongsan
, et al.
·
Proceedings of the VLDB Endowment
·
190
An upper bound on the sum of squares of degrees in a graph
1998
·
D. de Caen
·
Discrete Mathematics
·
186
PDF
Multicore triangle computations without tuning
2015
·
Julian Shun
, Kanat Tangwongsan
·
Proceedings - International Conference on Data Engineering
·
162
Colorful triangle counting and a MapReduce implementation
2011
·
Rasmus Pagh
, Charalampos E. Tsourakakis
·
Information Processing Letters
·
162
Clustering in complex networks. I. General formalism
2006
·
M. Ángeles Serrano
, Marián Boguñá
·
Physical Review E
·
153
PDF
A space efficient streaming algorithm for triangle counting using the birthday paradox
2013
·
Madhav Jha
, C. Seshadhri
, et al.
·
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
·
148
PDF
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
2012
·
Mihail N. Kolountzakis
, Gary L. Miller
, et al.
·
Internet Mathematics
·
148
PDF
New Streaming Algorithms for Counting Triangles in Graphs
2005
·
Hossein Jowhari
, Mohammad Ghodsi
·
Lecture notes in computer science
·
146
ESCAPE
2017
·
Ali Pinar
, C. Seshadhri
, et al.
·
International World Wide Web Conference (WWW)
·
140
PDF
Parallel Triangle Counting and Enumeration Using Matrix Algebra
2015
·
Ariful Azad
, Aydin Buluc
, et al.
·
140
Gunrock
2017
·
Yangzihao Wang
, Yuechao Pan
, et al.
·
ACM Transactions on Parallel Computing
·
136
Path Sampling
2015
·
Madhav Jha
, C. Seshadhri
, et al.
·
International World Wide Web Conference (WWW)
·
130
Calibrating data to sensitivity in private data analysis
2014
·
Davide Proserpio
, Sharon Goldberg
, et al.
·
Proceedings of the VLDB Endowment
·
127
PATRIC
2013
·
Shaikh Arifuzzaman
, Maleq Khan
, et al.
·
Proceedings of the ... ACM International Conference on Information & Knowledge Management
·
120
Pentagons vs. triangles
2007
·
Béla Bollobás
, Ervin Győri
·
Discrete Mathematics
·
117
PDF
Private Release of Graph Statistics using Ladder Functions
2015
·
Jun Zhang
, Graham Cormode
, et al.
·
Proceedings - ACM-SIGMOD International Conference on Management of Data
·
116
AutoMine
2019
·
Daniel Mawhirter
, Bo Wu
·
115
PDF
CoreScope: Graph Mining Using k-Core Analysis — Patterns, Anomalies and Algorithms
2016
·
Kijung Shin
, Tina Eliassi-Rad
, et al.
·
Proceedings
·
110
Show more works
View as search
Works count:
808
Citation count:
12,370
Year
Topic
Type
