Asset Details
Do you wish to reserve the book?
Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
Do you wish to request the book?
Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
1998
Overview
Directed st-connectivity is the problem of detecting whether there is a path from a distinguished vertex s to a distinguished vertex t in a directed graph. We prove time--space lower bounds of $ST = \\Omega({n^{2} \\log n \\over \\log (n \\log n/S)})$ and $S^{1 \\over 2}T = \\Omega(m (n \\log n)^{1 \\over 2})$ for directed st-connectivity on Cook and Rackoff's jumping automaton for graphs (JAG) model [SIAM J. Comput., 9(1980), pp. 636--652], where n is the number of vertices and m the number of edges in the input graph, S is the space, and T the time used by the JAG. These lower bounds are simple and elegant, they approach the known upper bound of T = O(m) when S approaches $\\Theta(n \\log n)$, and they are the first time--space tradeoffs for JAGs with an unrestricted number of jumping pebbles.
Publisher
Society for Industrial and Applied Mathematics
