Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies-Reference-Cited by-同舟云学术

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

Published:2009 Issue: Volume: Page:411-422
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Cooper Colin,Ilcinkas David,Klasing Ralf,Kosowski Adrian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02930-1_34

Reference22 articles.

1. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (2001), http://stat-www.berkeley.edu/users/aldous/RWG/book.html

2. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal sequences and the complexity of maze problems. In: Proceedings of the 20th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1979), pp. 218–223 (1979)

3. Bender, M.A., Fernández, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176(1), 1–21 (2002)

4. Bhatt, S.N., Even, S., Greenberg, D.S., Tayar, R.: Traversing directed eulerian mazes. Journal of Graph Algorithms and Applications 6(2), 157–173 (2002)

5. Cooper, J., Doerr, B., Friedrich, T., Spencer, J.: Deterministic Random Walks on Regular Trees. In: Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 766–772 (2008)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The power of two choices for random walks;Combinatorics, Probability and Computing;2021-05-28

2. The Cover Time of Deterministic Random Walks;Lecture Notes in Computer Science;2010

3. Euler Tour Lock-In Problem in the Rotor-Router Model;Lecture Notes in Computer Science;2009

4. Robustness of the Rotor-router Mechanism;Lecture Notes in Computer Science;2009