Searching for "Short Random Walks on Graphs." – sorted by Relevance.
-
Short Random Walks On Graphs
- SHORT RANDOM WALKS ON GRAPHS GREG BARNES y AND URIEL FEIGE z Abstract. The short term behavior
- Cited by 25 (2 self) – Add To MetaCart
-
An O(log (n)^4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs
- and Phrases: undirected graph connectivity, short pseudo-random walks on graphs, derandomization, space
- Cited by 6 (0 self) – Add To MetaCart
-
An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM
- the same time, Karger, Nisan and Parnas [KNP92] used the interesting technique of short random walks
- Cited by 12 (1 self) – Add To MetaCart
-
SL ⊆ L^4/3
- the UTS of [NSW92] by a pseudo-random walk using Nisan's gen1 erator with short hash functions. We show
- Add To MetaCart

