Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

DOI10.1007/978-3-642-02930-1_34MaRDI QIDQ3638110zbMATH OpenOpenAlexFDO

Authors Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski

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

zbMATH Keywords

derandomize random walksexploring an anonymous graphleast used firstoblivious robotoldest first

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81)

Recommendations

• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Efficient exploration of anonymous undirected graphs
• Memory Efficient Anonymous Graph Exploration

Cited in

(4)

• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Locally guided randomized elections in trees: The totally fair case
• Efficient exploration of anonymous undirected graphs
• The power of two choices for random walks

This page was built for publication: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638110)