Author:
Bampas Evangelos,Gąsieniec Leszek,Klasing Ralf,Kosowski Adrian,Radzik Tomasz
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bender, M.A., Fernández, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Inf. Comput. 176(1), 1–21 (2002)
2. Bhatt, S.N., Even, S., Greenberg, D.S., Tayar, R.: Traversing directed Eulerian mazes. J. Graph Algorithms Appl. 6(2), 157–173 (2002)
3. de Bruijn, N.G., Aardenne-Ehrenfest, T.: Circuits and trees in oriented linear graphs. Simon Stevin (Bull. Belgian Math. Soc.) 28, 203–217 (1951)
4. Lecture Notes in Computer Science;C. Cooper,2009
5. Cooper, J.N., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability & Computing 15(6), 815–822 (2006)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献