3 search results - page 1 / 1 » Undirected ST-connectivity in log-space |
STOC
1989
ACM
13 years 9 months ago
1989
ACM
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...