Tree exploration with little memory

Diks, K. (Krzysztof), Fraigniaud, P. (Pierre), E. Kranakis (Evangelos) and Pelc, A. (Andrzej)

2004-04-01

Journal of Algorithms , Volume 51 - Issue 1 p. 38- 63

Additional Metadata
Keywords	Graph exploration, Universal traversal sequences
Persistent URL	doi.org/10.1016/j.jalgor.2003.10.002
Journal	Journal of Algorithms
Organisation	School of Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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

Publication