73 search results - page 1 / 15 » Counting triangles in data streams |
PODS
2006
ACM
14 years 11 months ago
2006
ACM
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
KDD
2009
ACM
14 years 11 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...
WWW
2011
ACM
13 years 5 months 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...