Lower bounds for testing digraph connectivity with one-pass streaming algorithms.

Glencora Borradaile Claire Mathieu Theresa Migler

Published in: CoRR (2014)

Keyphrases

lower bound
worst case
learning algorithm
orders of magnitude
computational complexity
binary trees
benchmark datasets
computational cost
significant improvement
upper bound
optimization problems
computationally efficient
search algorithm
data structure
data streams
test cases
running times
real time