A fast randomized LOGSPACE algorithm for graph connectivity
- 5 December 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 169 (2), 147-160
- https://doi.org/10.1016/s0304-3975(96)00118-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Random Walks on Regular and Irregular GraphsSIAM Journal on Discrete Mathematics, 1996
- Short Random Walks on GraphsSIAM Journal on Discrete Mathematics, 1996
- Computing with Noisy InformationSIAM Journal on Computing, 1994
- Random walks and the effective resistance of networksJournal of Theoretical Probability, 1991
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989