Login / Signup
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models.
Greg Barnes
Jeff Edmonds
Published in:
SIAM J. Comput. (1998)
Keyphrases
</>
lower bound
connected components
random walk
finite state machines
upper bound
weighted graph
objective function
cellular automata
finite state
graph representation
vc dimension
random graphs