Login / Signup
Polynomial pass lower bounds for graph streaming algorithms.
Sepehr Assadi
Yu Chen
Sanjeev Khanna
Published in:
STOC (2019)
Keyphrases
</>
lower bound
computational complexity
graph theory
learning algorithm
upper bound
random walk
worst case
optimization problems
combinatorial optimization
directed graph
graph structure
strongly connected