Sciweavers

4 search results - page 1 / 1
» DOULION: counting triangles in massive graphs with a coin
Sort
View
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 7 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
KDD
2008
ACM
123views Data Mining» more  KDD 2008»
14 years 7 months ago
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Luca Becchetti, Paolo Boldi, Carlos Castillo, Aris...
WWW
2011
ACM
13 years 2 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
TCS
2008
13 years 7 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy