On graph problems in a semi-streaming model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 531-543

  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

ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH THEORY;

ALGORITHM IMPROVEMENTS; CONSTANT APPROXIMATION ALGORITHMS; GRAPH PROBLEMS; MASSIVE GRAPH; STORAGE SPACES; STREAMING MODEL; WEIGHTED GRAPH; WEIGHTED MATCHING;

PROBLEM SOLVING;

EID: 35048854709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_46     Document Type: Article

References (21)

1. J. Abello, A.L. Buchsbaum, J.R. Westbrook. A Functional Approach to External Graph Algorithms. Algorithmica, 32(3): 437-458, 2002.
2. I. Althöfer, G. Das, D. Dobkin, and D. Joseph. Generating sparse spanners for weighted graphs. In Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT'90), LNCS 447, 26-37, 1990.
3. 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, Feb. 1999.
4. A.L. Buchsbaum, R. Giancarlo and J.R. Westbrook. On finding common neighborhoods in massive graphs. Theoretical Computer Science, 299 (1-3):707-718, 2003.
5. 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.
6. B. Bollobás. Extremal Graph Theory. Academic Press, New York, 1978.
7. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. on Computing, 28:210-236, 1998.
8. P. Drineas and R. Kannan. Pass Efficient Algorithm for approximating large matrices. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 2003.
9. D. Eppstein, Z. Galil, and G.F. Italiano. Dynamic graph algorithms. CRC Handbook of Algorithms and Theory of Computation, Chapter 8, 1999.
10. 1 difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
11. P. Flajolet and G.N. Martin. Probabilistic counting. In Proc. 24th IEEE Symposium on Foundation of Computer Science, pages 76-82, 1983.
12. 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.
13. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. 33th ACM Symposium on Theory of Computing, pages 471-475, 2001.
14. M. Rauch Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-001, DEC Systems Research Center, 1998.
15. 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.
16. M. Karpinski and W. Rytter Fast Parallel Algorithms for Graph Matching Problems, Oxford Lecture Series in Math. and its Appl. Oxford University Press, 1998.
17. B. Kalyanasundaram and G. Schnitger. The Probabilistic Communication Complexity of Set Intersection. SIAM Journal on Discrete Math., 5:545-557, 1990.
18. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In Proceedings of the 25th VLDB Conference, pages 639-650, 1999.
19. S. Muthukrishnan. Data streams: Algorithms and applications. 2003. Available at "http://athos.rutgers.edu/∼muthu/stream-1-1.ps"
20. R. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983.
21. R. Uehara and Z. Chen. Parallel approximation algorithms for maximum weighted matching in general graphs. Information Processing Letters, 76(1-2):13-17, 2000.