Short random walks on graphs

DOI10.1145/167088.167275zbMath1310.05188OpenAlexW2061297447MaRDI QIDQ5248544

Greg Barnes, Uriel Feige

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B790-8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)

Related Items (6)

A fast randomized LOGSPACE algorithm for graph connectivity ⋮ Poisson approximation for non-backtracking random walks ⋮ Random walks and diffusion on networks ⋮ Sensitivity of Mixing Times in Eulerian Digraphs ⋮ A model of self‐avoiding random walks for searching complex networks ⋮ Memory efficient algorithms for cactus graphs and block graphs

This page was built for publication: Short random walks on graphs