Abstract
We present three streaming algorithms that (ε,δ)– approximate 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Babai, L., Atai, A.: A fast and simple randomized algorithm for maximum indepedent set problem. J. Algorithms 7, 567–583 (1986)
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996 (1996)
Bar-Yossef, Z., Kumar, R., Sivakumar, S.: Reduction in streaming algorithms with an application of counting triangles in graphs. In: SODA 2002 (2002)
Buchsbaum, A.L., Gianvarlo, R., Westbrook, J.R.: On finding common neighborhoods in massive graphs. Thoretical Computer Science 299(1-3), 707–718 (2003)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in streaming model; the value of space. Yale University Technical Report (2004)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. To appear in the 31st International Colloquium on Automata, Languages and Programming (2004)
Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams, Technical Report 1998-001, DEC Systems Research Center (1998)
Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5, 545–557 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jowhari, H., Ghodsi, M. (2005). New Streaming Algorithms for Counting Triangles in Graphs. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_72
Download citation
DOI: https://doi.org/10.1007/11533719_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)