A fast randomized LOGSPACE algorithm for graph connectivity

DOI10.1016/S0304-3975(96)00118-1zbMath0874.68236MaRDI QIDQ1349893

Uriel Feige

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (max. 100)

Voronoi-like nondeterministic partition of a lattice by collectives of finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Universal classes of hash functions
• Two Applications of Inductive Counting for Complementation Problems
• Computing with Noisy Information
• Short Random Walks on Graphs
• Random Walks on Regular and Irregular Graphs

This page was built for publication: A fast randomized LOGSPACE algorithm for graph connectivity