1. Aleliunas R, Karp R, Lipton R, Lovasz L, Rackoff C (1979) Random walks, universal traversal sequences and the complexity of maze problems. In: FOCS 79, pp 218–223
2. Aldous DJ (1990) The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J Discrete Math 3:450–465
3. Amis AD, Prakash R, Vuong THP, Huynh DT (2000) Max-min d-cluster formation in wireless ad hoc networks. In: IEEE INFOCOM, pp 32–41
4. Basagni S (1999) Distributed clustering for ad hoc networks. In: International symposium on parallel architectures, algorithms and networks (ISPAN), pp 310–315
5. Bernard T, Bui A, Pilard L, Sohier D (2010) Distributed clustering algorithm for large-scale dynamic networks. Int J Clust Comput. doi: 10.1007/s10586-011-0153-z