Graph distances in the data-stream model

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1709-1727

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

^a Yale University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c The Manning College of Information and Computer Sciences   (United States)

^d YAHOO RESEARCH   (United States)

^e Louisiana State University   (United States)

Author keywords

Graph distances; Spanners; Stream algorithms

Indexed keywords

ALGORITHMIC TECHNIQUES; ARBITRARY ORDERS; COMPUTATION TIMES; DESIGN ALGORITHMS; GRAPH ALGORITHMS; GRAPH DISTANCES; GRAPH PROBLEMS; GRAPH PROPERTIES; LOWER BOUNDS; MASSIVE GRAPHS; MODEL PARAMETERS; PROCESSING GRAPHS; PROCESSING TIMES; SHORTEST CYCLES; SPANNERS; STREAM ALGORITHMS; STREAM MODELS; STREAMING ALGORITHMS; WEB GRAPHS; WORKING MEMORIES;

COMMERCE; CONTROL THEORY; DATA PROCESSING; DATA STORAGE EQUIPMENT; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES;

TREES (MATHEMATICS);

EID: 57849122137     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070683155     Document Type: Article

References (42)

1. J. ABELLO, A. L. BUCHSBAUM, AND J. WESTBROOK, A functional approach to external graph algorithms, Algorithmica, 32 (2002), pp. 437-458.
2. G. AGGARWAL, M. DATAR, S. RAJAGOPALAN, AND M. RUHL, On the streaming model augmented with a sorting primitive, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 2004, pp. 540-549.
3. R. ALBERT, H. JEONG, AND A.-L. BARABASI, The diameter of the world wide web, Nature, 401 (1999), p. 130.
4. N. ALON, Y. MATIAS, AND M. SZEGEDY, The space complexity of approximating the frequency moments, J. Comput. System Sci., 58 (1999), pp. 137-147.
5. B. AWERBUCH, B. BERGER, L. COWEN, AND D. PELEG, Near-linear time construction of sparse neighborhood covers, SIAM J. Comput., 28 (1998), pp. 263-277.
6. Z. BAR.-YOSSEF, R. KUMAR, AND D. SIVAKUMAR, Reductions in streaming algorithms, with an application to counting triangles in graphs, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2002, pp. 623-632.
7. 1+1/k) size in weighted graphs, in Proceedings of the International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, pp. 384-396.
8. S. BASWANA, Streaming algorithm for graph spanners - single pass and constant processing time per edge, Inform. Process. Lett., 106 (2007), pp. 110-114.
9. B. BOLLOBÁS, Random Graphs, Academic Press, London, 1985.
10. A. L. BUCHSBAUM, R. GLANCARLO, AND J. WESTBROOK, On finding common neighborhoods in massive graphs, Theoret. Comput. Sci., 299 (2003), pp. 707-718.
11. L. S. BURIOL, G. FRAHLING, S. LEONARDI, A. MARCHETTI-SPACCAMELA, AND C. SOHLER, Counting triangles in data streams, in Proceedings of the ACM Symposium on Principles of Database Systems, ACM, New York, 2006, pp. 253-262.
12. A. CHAKRABARTI, G. CORMODE, AND A. MCGREGOR, A near-optimal algorithm for computing the entropy of a stream, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2007, pp. 328-335.
13. E. COHEN, Fast algorithms for constructing t-spanners and paths with stretch t, SIAM J. Comput., 28 (1998), pp. 210-236.
14. T. H. GORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, MIT Press, Cambridge, MA, McGraw-Hill, New York, 2001.
15. G. CORMODE AND S. MUTHUKRISHNAN, Space efficient mining of multigraph streams, in Proceedings of the ACM Symposium on Principles of Database Systems, ACM, New York, 2005, pp. 271-282.
16. C. DEMETRESCU, I. FLNOCCHI, AND A. RIBICHINI, Trading off space for passes in graph streaming problems, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2006, pp. 714-723.
17. M. ELKIN, Computing almost shortest paths, ACM Trans. Algorithms, 1 (2005), pp. 283-323.
18. M. ELKIN, Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners, in Proceedings of the International Colloquium on Automata, Languages and Programming, Wroclaw, Poland, 2007, pp. 716-727.
19. M. ELKIN AND J. ZHANG, Efficient algorithms for constructing (1 + e,β)-spanners in the distributed and streaming models, Distributed Computing, 18 (2006), pp. 375-385.
20. D. EPPSTEIN, Z. GALIL, G. F. ITALIANO, AND A. NISSENZWEIG, Sparsification - a technique for speeding up dynamic graph algorithms, J. ACM, 44 (1997), pp. 669-696.
21. J. FEIGENBAUM, S. KANNAN, A. MCGREGOR, S. SURI, AND J. ZHANG, Graph distances in the streaming model: The value of space, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 745-754.
22. J. FEIGENBAUM, S. KANNAN, A. MCGREGOR, S. SURI, AND J. ZHANG, On graph problems in a semi-streaming model, Theoret. Comput. Sci., 348 (2005), pp. 207-216.
23. 1-difference algorithm for massive data streams, SIAM J. Comput., 32 (2002), pp. 131-151.
24. A. C. GILBERT, S. GUHA, P. INDYK, Y. KOTIDIS, S. MUTHUKRISHNAN, AND M. STRAUSS, Fast, small-space algorithms for approximate histogram maintenance, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 389-398.
25. M. GREENWALD AND S. KHANNA, Efficient online computation of quantile summaries, in Proceedings of the ACM International Conference on Management of Data, ACM, New York, 2001, pp. 58-66.
26. S. GUHA, N. KOUDAS, AND K. SHIM, Approximation and streaming algorithms for histogram construction problems, ACM Trans. Database Syst., 31 (2006), pp. 396-438.
27. M. R. HENZINGER, P. RAGHAVAN, AND S. RAJAGOPALAN, Computing on data streams, in External Memory Algorithms, AMS, Providence, RI, 1999, pp. 107-118.
28. P. INDYK, Stable distributions, pseudorandom generators, embeddings and data stream computation, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 2000, pp. 189-197.
29. P. INDYK AND D. P. WOODRUFF, Optimal approximations of the frequency moments of data streams, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 2005, pp. 202-208.
30. R. JAIN, J. RADHAKRISHNAN, AND P. SEN, A direct sum theorem in communication complexity via message compression, in Proceedings of the International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, pp. 300-315.
31. H. JOWHARI AND M. GHODSI, New streaming algorithms for counting triangles in graphs, in Proceedings of the International Conference on Computing and Combinatorics, Kunming, Yunnan, China, 2005, pp. 710-716.
32. B. KALYANASUNDARAM AND G. SCHNITGER, The probabilistic communication complexity of set intersection, SIAM J. Discrete Math., 5 (1992), pp. 545-557.
33. R. KUMAR, P. RAGHAVAN, S. RAJAGOPALAN, AND A. TOMKINS, Extracting large-scale knowledge bases from the web, in Proceedings of the International Conference on Very Large Data Bases, Edinburgh, Scotland, 1999, pp. 639-650.
34. E. KUSHILEVITZ AND N. NISAN, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
35. F. LAZEBNIK, V. A. U STIMENKO, AND A. J. WOLDAR, A new series of dense graphs of high girth, Bull. AMS, 32 (1995), pp. 73-79.
36. A. MCGREGOR, Finding graph matchings in data streams, in Proceedings of APPROX-RANDOM, Berkeley, CA, 2005, pp. 170-181.
37. S. MUTHUKRISHNAN, Data Streams: Algorithms and Applications, Now Publishers, Boston, 2005.
38. N. NLSAN AND A. WIGDERSON, Rounds in communication complexity revisited, SIAM J. Comput., 22 (1993), pp. 211-219.
39. A. A. RAZBOROV, On the distributional complexity of disjointness, Theoret. Comput. Sci., 106 (1992), pp. 385-390.
40. M. THORUP AND U. ZWICK, Approximate distance oracles, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 183-192.
41. M. ZELKE, k-connectivity in the semi-streaming model, http://arxiv.org/abs/cs/0608066, 2006.
42. M. ZELKE, Optimal per-edge processing times in the semi-streaming model, Inform. Process. Lett., 104 (2007), pp. 106-112.