Short Random Walks on Graphs
From MaRDI portal
Publication:4875432
DOI10.1137/S0895480194264988zbMath0843.60065MaRDI QIDQ4875432
Publication date: 24 April 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (6)
A fast randomized LOGSPACE algorithm for graph connectivity ⋮ A spectrum of time-space trade-offs for undirected \(s-t\) connectivity ⋮ A tight upper bound on acquaintance time of graphs ⋮ The electrical resistance of a graph captures its commute and cover times ⋮ Markov incremental constructions ⋮ Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space
This page was built for publication: Short Random Walks on Graphs
