Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
arXiv:2009.01161
Abstract
We prove that any two-pass graph streaming algorithm for the - reachability problem in -vertex directed graphs requires near-quadratic space of bits. As a corollary, we also obtain near-quadratic space lower bounds for several other fundamental problems including maximum bipartite matching and (approximate) shortest path in undirected graphs. Our results collectively imply that a wide range of graph problems admit essentially no non-trivial streaming algorithm even when two passes over the input is allowed. Prior to our work, such impossibility results were only known for single-pass streaming algorithms, and the best two-pass lower bounds only ruled out space algorithms, leaving open a large gap between (trivial) upper bounds and lower bounds.
References in corpus (6)
- Improved approximation guarantees for weighted matching in the semi-streaming model
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
- On Estimating Maximum Matching Size in Graph Streams
- Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms
- Towards Tight Bounds for the Streaming Set Cover Problem
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams