New streaming algorithms for counting triangles in graphs

Abstract

We present three streaming algorithms that (ε, δ) - approximate1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presented algorithms are inversely proportional to the number of triangles while, for some families of graphs, the space usage is improved. We also prove a lower bound, based on the number of triangles, which indicates that our first algorithm behaves almost optimally on graphs with constant degrees. © Springer-Verlag Berlin Heidelberg 2005.