A sublinear space, polynomial time algorithm for directed s-t connectivity

A deterministic sublinear space, polynomial-time algorithm for directed s-t connectivity, which is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph, is presented. For n-vertex graphs, the algorithm can use as little as n/2/sup Theta /( square root log n) space while still running in polynomial time.<
>