1. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: Proc. 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 20–24. ACM Press, New York (2004)
2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)
3. Chu, Y., Liu, T.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396–1400 (1965)
4. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: Proc. 32nd Int. Colloq. on Automata, Languages & Prog. (ICALP). Lecture Notes of Computer Science, vol. 3580, pp. 335–346 (2005)
5. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling schemes for tree representation. In: Proceedings of 7th International Workshop on Distributed Computing (IWDC). Lecture Notes of Computer Science, vol. 3741, pp. 13–24 (2005)