On Estimating Maximum Matching Size in Graph Streams

Abstract

We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams, which only contain edge insertions, and dynamic streams that allow both insertions and deletions of the edges, and present new upper and lower bound results for both cases. On the upper bound front… (More)

Topics

Cite this paper

@inproceedings{Assadi2017OnEM, title={On Estimating Maximum Matching Size in Graph Streams}, author={Sepehr Assadi and Sanjeev Khanna and Yang Li}, booktitle={SODA}, year={2017} }