Finding graph matchings in data streams

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 170-181

  McGregor, Andrew ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MODELS;

CARDINALITY MATCHING; DATA STREAMS; GRAPH MATCHINGS;

GRAPH THEORY;

EID: 27144517635     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_15     Document Type: Conference Paper

References (17)

1. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards 69 (1965) 125-130
2. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. ACM-SIAM Symposium on Discrete Algorithms. (1990) 434-443
3. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 (1973]_225-231
4. Micali, S., Vazirani, V.: An O(√V E) algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science. (1980)
5. Drake, D.E., Hougardy, S.: Improved linear time approximation algorithms for weighted matchings. In Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A., eds.: RANDOM-APPROX. Volume 2764 of Lecture Notes in Computer Science., Springer (2003) 14-23
6. Kalantari, B., Shokoufandeh, A.: Approximation schemes for maximum cardinality matching. Technical Report LCSR-TR-248, Laboratory for Computer Science Research, Department of Computer Science. Rutgers University (1995)
7. Preis, R.: Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In Meinel, C., Tison, S., eds.: STAGS. Volume 1563 of Lecture Notes in Computer Science., Springer (1999) 259-269
8. Muthukrishnan, S.: Data streams: Algorithms and applications. (2003) Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps.
9. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. In: Proc. 31st International Colloquium on Automata, Languages and Programming. (2004) 531-543
10. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: The value of space. Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (2005)
11. Munro, J., Paterson, M.: Selection and sorting with limited storage. Theoretical Computer Science 12 (1980) 315-323
12. Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. Technical Report 1998-001, DEC Systems Research Center (1998)
13. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58 (1999) 137-147
14. 1 difference algorithm for massive data streams. SIAM Journal on Computing 32 (2002) 131-151
15. Guha, S., Mishra, N., Motwani, R., O'Callaghan, L.: Clustering data streams. In: Proc. 41th IEEE Symposium on Foundations of Computer Science. (2000) 359-366
16. Drineas, P., Kannan, R.: Pass efficient algorithms for approximating large matrices. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms. (2003) 223-232
17. Buchsbaum, A.L., Giancarlo, R., Westbrook, J.: On finding common neighborhoods in massive graphs. Theor. Comput. Sci. 1-3 (2003) 707-718