A fast randomized LOGSPACE algorithm for graph connectivity

DOI10.1007/3-540-58201-0_93zbMath1418.68167OpenAlexW2999050090MaRDI QIDQ4632451

No author found.

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_93

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20)

Related Items (1)

A spectrum of time-space trade-offs for undirected \(s-t\) connectivity

Cites Work

• Universal classes of hash functions
• Random Walks on Regular and Irregular Graphs
• Short random walks on graphs

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