Asset Details
Do you wish to reserve the book?
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
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?
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Do you wish to request the book?
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
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
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
1998
Overview
Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the first known deterministic sublinear space, polynomial time algorithm for directed s-t connectivity. For $n$-vertex graphs, our algorithm can use as little as $n/2^{\\Theta(\\sqrt{\\log n})}$ space while still running in polynomial time.
Publisher
Society for Industrial and Applied Mathematics
