2004-04-01
Tree exploration with little memory
Publication
Publication
Journal of Algorithms , Volume 51 - Issue 1 p. 38- 63
Additional Metadata | |
---|---|
Graph exploration, Universal traversal sequences | |
dx.doi.org/10.1016/j.jalgor.2003.10.002 | |
Journal of Algorithms | |
Organisation | School of Computer Science |
Diks, K. (Krzysztof), Fraigniaud, P. (Pierre), Kranakis, E, & Pelc, A. (Andrzej). (2004). Tree exploration with little memory. Journal of Algorithms, 51(1), 38–63. doi:10.1016/j.jalgor.2003.10.002
|