85 search results - page 1 / 17 » New Streaming Algorithms for Counting Triangles in Graphs |
COCOON
2005
Springer
13 years 10 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...
WWW
2011
ACM
12 years 11 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...
KAIS
2011
12 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
KDD
2009
ACM
14 years 5 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