4 search results - page 1 / 1 » DOULION: counting triangles in massive graphs with a coin |
KDD
2009
ACM
14 years 6 months ago
2009
ACM
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...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
WWW
2011
ACM
13 years 11 days ago
2011
ACM
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...
TCS
2008
13 years 5 months ago
2008
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 ...