1. Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs, Chap. 14 (1999). http://www.stat.berkeley.edu/aldous/RWG/book.html
2. Avin, C., Koucky, M., Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th ICALP’08, LNCS, vol. 5125, pp. 121–132 (2008)
3. Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocation. SIAM J. Comput. 29(1), 180–200 (1999)
4. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31–44 (2011)
5. Becchetti, L., Clementi, A.E.F., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Information spreading in opportunistic networks is fast. arXiv:1107.5241v1 (2011)