New streaming algorithms for counting triangles in graphs

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 710-716

  Jowhari, Hossein ^a   Ghodsi, Mohammad ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; COMBINATORIAL MATHEMATICS; GRAPHIC METHODS;

DEGREES; SPACE USAGE; TRIANGLES; CONSTANT DEGREE; LOWER BOUNDS; NUMBER OF TRIANGLES; STREAMING ALGORITHM;

ALGORITHMS;

EID: 26844503695     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_72     Document Type: Conference Paper

References (8)

1. N. Alon, L. Babai, A. Atai. A fast and simple randomized algorithm for maximum indepedent set problem. J. Algorithms 7(1986), 567-583.
2. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. STOC 96.
3. Z. Bar-Yossef, R. Kumar, S. Sivakumar. Reduction in streaming algorithms with an application of counting triangles in graphs. SODA 2002.
4. A.L Buchsbaum, R. Gianvarlo, and J.R Westbrook. On finding common neighborhoods in massive graphs. Thoretical Computer Science, 299 (1-3):707-718, 2003.
5. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang, Graph distances in streaming model; the value of space. Yale University Technical Report. 2004.
6. J. Feigenbaum, S.Kannan, A. McGregor, S. Suri, and J. Zhang, On graph problems in a semi-streaming model. To appear in the 31st International Colloquium on Automata, Languages and Programming, 2004.
7. M. R. Henzinger, P. Raghavan, and S. Rajagopalan, Computing on data streams, Technical Report 1998-001, DEC Systems Research Center .1998.
8. B. Kalyanasundaram and G. Schnitger, The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5 545-557, 1990.