Graph distances in the streaming model: The value of space

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 745-754

  Feigenbaum, Joan ^a   Kannan, Sampath ^b   McGregor, Andrew ^b   Suri, Siddharth ^b   Zhang, Jian ^a  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESTRICTION; GRAPH DISTANCES; RANDOMIZED ALGORITHM; STREAMING MODEL;

ALGORITHMS; APPROXIMATION THEORY; EDGE DETECTION; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES;

GRAPH THEORY;

EID: 20744452339     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing, 28(4):1167-1181, 1999.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1): 137-147, 1999.
3. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998.
4. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 2002.
5. 1+1/k) size in weighted graphs. In Proc. 30th International Colloq. on Automata, Languages and Computing, pages 284-296, 2003.
6. C. Damm, S. Jukna and J. Sgall. Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Computational Complexity, 7(2):109-127, 1998.
7. P. Drineas and R. Kannan. Pass efficient algorithms for approximating large matrices. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 2003.
8. M. Elkin. Computing almost shortest paths. In Proc. 20th ACM Symposium on Principles of Distributed Computing, pages 53-62, 2001.
9. M. Elkin and J. Zhang. Efficient algorithms for constructing (1 + ε, β)-spanners in the distributed and streaming models, in Proc. 23th ACM Symposium on Principles of Distributed Computing, pages 160-168, 2004.
10. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM, 44(5):669-696, 1997.
11. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. In Proc. of 31st International Colloquium on Automata, Languages and Programming, LNCS 3142, pages 531-543, 2004.
12. 1 difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
13. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proc. 34th ACM Symposium on Theory of Computing, pages 389-398, 2002.
14. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proc. 27th International Conference on Very Large Data Bases, pages 79-88, 2001.
15. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. 33th ACM Symposium on Theory of Computing, pages 471-475, 2001.
16. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proc. 41th IEEE Symposium on Foundations of Computer Science, pages 359-366, 2000.
17. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-001, DEC Systems Research Center, 1998.
18. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41th IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
19. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
20. F. Lazebnik, V. Ustimenko, and A. Woldar. A new series of dense graphs of high girth. Bulletin of the AMS, 32(1):73-79, 1995.
21. J. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
22. S. Muthukrishnan. Data streams: Algorithms and applications. 2003. http://athos.rutgers.edu/~muthu/stream-1-1.ps.
23. N. Nisan and A. Widgerson. Rounds in communication complexity revisited. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 419-429, 1991.
24. S. Ponzio, J. Radhakrishnan, and S. Venkatesh. The communication complexity of pointer chasing. Journal of Computer and System Sciences, 62(2):323-355, 2001.
25. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33th ACM Symposium on Theory of Computing, pages 183-192, 2001.