Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
From MaRDI portal
Publication:3638110
DOI10.1007/978-3-642-02930-1_34zbMath1247.05223OpenAlexW2079729465MaRDI QIDQ3638110
David Ilcinkas, Ralf Klasing, Adrian Kosowski, Colin Cooper
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_34
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)
Related Items