Bipartite Graph Matching in the Semi-Streaming Model (Lecture Notes 2014)

We give an introduction to classical algorithms for the maximum matching problem in bipartite graphs and then present a 1 " approximation algorithm for the same problem in bipartite graph streams, which only requires Opn poly lognq bits of random-access memory and Op" 5 q passes over the input. All the algorithms are combinatorial in nature and use the augmenting paths technique. The streaming part of these notes is based on joint work with Sebastian Eggert, Peter Munstermann, and Anand Srivastav from Kiel University [EKM+12].

[1]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[3]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[4]  A. Kemper,et al.  On Graph Problems in a Semi-streaming Model , 2015 .

[5]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6]  Jonathan A. Kelner,et al.  Spectral Sparsification in the Semi-streaming Setting , 2012, Theory of Computing Systems.

[7]  Anand Srivastav,et al.  Bipartite Matching in the Semi-streaming Model , 2012, Algorithmica.

[8]  Sudipto Guha,et al.  Linear programming in the semi-streaming model with application to the maximum matching problem , 2011, Inf. Comput..

[9]  Andrew McGregor,et al.  Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.

[10]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[11]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[12]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[13]  Jeffrey D. Smith,et al.  Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[14]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[15]  Claire Mathieu,et al.  Maximum Matching in Semi-streaming with Few Passes , 2011, APPROX-RANDOM.

[16]  Mariano Zelke,et al.  Algorithms for streaming graphs , 2009 .

[17]  Lasse Kliemann,et al.  Matching in Bipartite Graph Streams in a Small Number of Passes , 2011, SEA.

[18]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[19]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..