J. I. Alvarez-hamelin, L. Dall-'asta, A. Barrat, and A. Vespignani, K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Networks and Heterogeneous Media, pp.371-293, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00012974

D. Angluin, J. Aspnes, Z. Diamadi, M. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, Distributed Computing, pp.235-253, 2006.

D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.34, issue.3, pp.279-304, 2007.
DOI : 10.1007/s00446-007-0040-2

C. Avin, M. Koucky, and Z. Lotker, How to explore a fast-changing world, Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), pp.121-132, 2008.

B. Awerbuch and S. Even, Efficient and reliable broadcast is achievable in an eventually connected network, Proceedings of 3rd ACM symposium on Principles of Distributed Computing (PODC'84), pp.278-281, 1984.

L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, Group formation in large social networks, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.44-54, 2006.
DOI : 10.1145/1150402.1150412

A. Balasubramanian, Y. Zhou, B. Croft, B. N. Levine, and A. Venkataramani, Web search from a bus, Proceedings of the second workshop on Challenged networks CHANTS , CHANTS '07, pp.59-66, 2007.
DOI : 10.1145/1287791.1287803

M. Bastian, S. Heymann, and M. Jacomy, Gephi: An open source software for exploring and manipulating networks, Proceedings of 3rd International AAAI Conference on Weblogs and Social Media, 2009.

H. Baumann, P. Crescenzi, and P. Fraigniaud, Parsimonious flooding in dynamic graphs, Proceedings of 28th ACM Symposium on Principles of Distributed Computing, pp.260-269, 2009.

K. A. Berman, Vulnerability of scheduled networks and a generalization of Menger's Theorem, Networks, vol.28, issue.3, pp.125-134, 1996.
DOI : 10.1002/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P

S. Bhadra and A. Ferreira, Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks, Proceedings of 2nd International Conference on Ad Hoc, Mobile and Wireless Networks (AdHoc-Now), pp.259-270, 2003.
DOI : 10.1007/978-3-540-39611-6_23

V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10008, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

C. Boldrini and A. Passarella, HCMM: Modelling spatial and temporal properties of human mobility driven by users??? social relationships, Computer Communications, vol.33, issue.9, pp.1056-1074, 2010.
DOI : 10.1016/j.comcom.2010.01.013

K. Borne, S. Sanyal, and A. Vespignani, Network science, Annual Review of Information Science and Technology, vol.70, issue.21, pp.537-607, 2007.
DOI : 10.1002/aris.2007.1440410119

B. Bui-xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2003.
DOI : 10.1142/S0129054103001728
URL : https://hal.archives-ouvertes.fr/inria-00071996

J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-11, 2006.
DOI : 10.1109/INFOCOM.2006.228

T. Camp, J. Boleng, and V. Davies, Diameter of the world-wide web, Wireless Communications and Mobile Computing, pp.483-502, 2002.

I. Cardei, C. Liu, and J. Wu, Routing in Wireless Networks with Intermittent Connectivity, Encyclopedia of Wireless and Mobile Communications, 2007.

A. Casteigts, S. Chaumette, and A. Ferreira, Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks, Proceedings of 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.126-140, 2009.
DOI : 10.1145/72981.72982
URL : https://hal.archives-ouvertes.fr/hal-00408054

A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility, Proceedings of 5th IFIP Conference on Theoretical Computer Science (TCS), pp.111-124, 2010.
DOI : 10.1007/978-3-642-15240-5_9
URL : https://hal.archives-ouvertes.fr/hal-01054440

A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Measuring temporal lags in delay-tolerant networks, Proceedings of 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2011.
URL : https://hal.archives-ouvertes.fr/hal-00846992

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Impact of Human Mobility on Opportunistic Forwarding Algorithms, IEEE Transactions on Mobile Computing, vol.6, issue.6, pp.606-620, 2007.
DOI : 10.1109/TMC.2007.1060

A. Chaintreau, A. Mtibaa, L. Massoulie, and C. Diot, The diameter of opportunistic mobile networks, Proceedings of the 2007 ACM CoNEXT conference on , CoNEXT '07, pp.74-88, 2008.
DOI : 10.1145/1364654.1364670

A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri, Flooding time in edge-Markovian dynamic graphs, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.213-222, 2008.
DOI : 10.1145/1400751.1400781

A. Clementi and F. Pasquale, Information Spreading in Dynamic Networks: An Analytical Approach, Theoretical Aspects of Distributed Computing in Sensor Networks, 2010.
DOI : 10.1007/978-3-642-14849-1_19

A. Dutot, F. Guinand, D. Olivier, and Y. Pigné, Graphstream: A tool for bridging the gap between complex systems and dynamic graphs, Proceedings of of Emergent Properties in Natural and Artificial Complex Systems. (EPNACS), pp.63-72, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00264043

N. Eagle and A. , Reality mining: sensing complex social systems, Personal and Ubiquitous Computing, vol.10, issue.2, pp.255-268, 2006.
DOI : 10.1007/s00779-005-0046-3

J. Eriksson, H. Balakrishnan, and S. Madden, Cabernet, Proceedings of the 14th ACM international conference on Mobile computing and networking, MobiCom '08, pp.199-210, 2008.
DOI : 10.1145/1409944.1409968

A. Ferreira, Building a reference combinatorial model for MANETs, IEEE Network, vol.18, issue.5, pp.24-29, 2004.
DOI : 10.1109/MNET.2004.1337732

P. Flocchini, M. Kellett, P. Mason, and N. Santoro, Searching for Black Holes in Subways, Theory of Computing Systems, pp.158-184, 2012.
DOI : 10.1007/s00224-011-9341-8

P. Flocchini, B. Mans, and N. Santoro, Exploration of Periodically Varying Graphs, Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC), pp.534-543, 2009.
DOI : 10.1007/978-3-642-10631-6_55

A. Friggeri, E. Chelius, and . Fleury, Ego-munities, Exploring Socially Cohesive Person-based Communities, 2011.

F. Greve, L. Arantes, and P. Sens, What model and what conditions to implement unreliable failure detectors in dynamic networks?, Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS '11, 2011.
DOI : 10.1145/2034640.2034645
URL : https://hal.archives-ouvertes.fr/hal-01286584

P. Grindrod and M. Parsons, Social networks: Evolving graphs with memory dependent edges, Physica A: Statistical Mechanics and its Applications, vol.390, issue.21-22, 2010.
DOI : 10.1016/j.physa.2011.06.015

M. Grossglauser and M. Vetterli, Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.1954-1964, 2003.
DOI : 10.1109/INFCOM.2003.1209217

S. Guo and S. Keshav, Fair and efficient scheduling in data ferrying networks, Proceedings of the 2007 ACM CoNEXT conference on , CoNEXT '07, pp.1-13, 2007.
DOI : 10.1145/1364654.1364671

F. Harary and G. Gupta, Dynamic graph models, Mathematical and Computer Modelling, vol.25, issue.7, pp.79-88, 1997.
DOI : 10.1016/S0895-7177(97)00050-2

P. Holme, Network reachability of real-world contact sequences, Physical Review E, vol.71, issue.4, p.46119, 2005.
DOI : 10.1103/PhysRevE.71.046119

W. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, Modeling Time-Variant User Mobility in Wireless Mobile Networks, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.758-766, 2007.
DOI : 10.1109/INFCOM.2007.94

D. Ilcinkas and A. M. Wade, On the Power of Waiting When Exploring Public Transportation Systems, Proceedings of 15th International Conference on Principles of Distributed Systems (OPODIS), pp.451-464, 2011.
DOI : 10.1007/978-3-642-25873-2_31
URL : https://hal.archives-ouvertes.fr/hal-00656607

P. Jacquet, B. Mans, and G. Rodolakis, Information Propagation Speed in Mobile and Delay Tolerant Networks, IEEE Transactions on Information Theory, vol.56, issue.10, pp.5001-5015, 2009.
DOI : 10.1109/TIT.2010.2059830
URL : https://hal.archives-ouvertes.fr/inria-00196956

S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, Proceedings of Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp.145-158, 2004.

E. P. Jones, L. Li, J. K. Schmidtke, and P. A. Ward, Practical Routing in Delay-Tolerant Networks, IEEE Transactions on Mobile Computing, vol.6, issue.8, pp.943-959, 2007.
DOI : 10.1109/TMC.2007.1016

H. Kakugawa and M. Yamashita, A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks, 9th International Conference on Principles of Distributed Systems (OPODIS), pp.256-266, 2005.
DOI : 10.1007/11516798_19

D. Kempe and J. Kleinberg, Protocols and impossibility results for gossip-based communication mechanisms, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.471-480, 2002.
DOI : 10.1109/SFCS.2002.1181971

D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and inference problems for temporal networks, Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), p.513, 2000.

D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

A. Keränen and J. Ott, DTN over aerial carriers, Proceedings of the 4th ACM workshop on Challenged networks, CHANTS '09, pp.67-76, 2009.
DOI : 10.1145/1614222.1614234

G. Kossinets, J. Kleinberg, and D. Watts, The structure of information pathways in a social communication network, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 08, pp.435-443, 2008.
DOI : 10.1145/1401890.1401945

V. Kostakos, Temporal graphs, Physica A: Statistical Mechanics and its Applications, vol.388, issue.6, pp.1007-1023, 2009.
DOI : 10.1016/j.physa.2008.11.021

F. Kuhn, N. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010.
DOI : 10.1145/1806689.1806760

F. Kuhn, Y. Moses, and R. Oshman, Coordinated consensus in dynamic networks, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.1-10, 2011.
DOI : 10.1145/1993806.1993808

J. Leskovec, D. Chakrabarti, J. M. Kleinberg, C. Faloutsos, and Z. Ghahramani, Kronecker graphs: An approach to modeling networks, Journal of Machine Learning Research, vol.11, pp.985-1042, 2010.

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, 2007.
DOI : 10.1145/1217299.1217301

A. Lindgren, A. Doria, and O. Schelén, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing and Communications Review, vol.7, issue.3, pp.19-20, 2003.
DOI : 10.1145/961268.961272

I. Litovsky, Y. Métivier, and E. Sopena, Graph relabelling systems and distributed algorithms Handbook of Graph Grammars and Computing by Graph Transformation, 1999.

C. Liu and J. Wu, Scalable routing in cyclic mobile networks, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.9, pp.1325-1338, 2009.

Y. Mahéo, R. Said, and F. Guidec, Middleware support for delay-tolerant service provision in disconnected mobile ad hoc networks, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-6, 2008.
DOI : 10.1109/IPDPS.2008.4536339

R. O. Dell and R. Wattenhofer, Information dissemination in highly dynamic graphs, Proceedings of Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp.104-110, 2005.

M. Papadopouli and H. Schulzrinne, Seven degrees of separation in mobile ad hoc networks, Globecom '00, IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), pp.1707-1711, 2000.
DOI : 10.1109/GLOCOM.2000.891928

P. Ruiz, B. Dorronsoro, P. Bouvry, L. , and T. , Information dissemination in VANETs based upon a tree topology, Ad Hoc Networks, pp.111-127, 2012.
DOI : 10.1016/j.adhoc.2011.06.005

R. Ramanathan, P. Basu, and R. Krishnan, Towards a formalism for routing in challenged networks, Proceedings of the second workshop on Challenged networks CHANTS , CHANTS '07, pp.3-10, 2007.
DOI : 10.1145/1287791.1287794

F. J. Ros, P. M. Ruiz, and I. Stojmenovic, Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks, IEEE Transactions on Mobile Computing, vol.11, issue.1, pp.33-46, 2012.
DOI : 10.1109/TMC.2010.253

N. Santoro, W. Quattrociocchi, P. Flocchini, A. Casteigts, and F. Amblard, Time-varying graphs and social network analysis: Temporal indicators and metrics, 3rd AISB Social Networks and Multiagent Systems Symposium (SNAMAS), pp.32-38, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00854313

A. Scherrer, P. Borgnat, E. Fleury, J. L. Guillaume, and C. Robardet, Description and simulation of dynamic mobility networks, Computer Networks, vol.52, issue.15, pp.522842-2858, 2008.
DOI : 10.1016/j.comnet.2008.06.007
URL : https://hal.archives-ouvertes.fr/inria-00397375

T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Spray and wait, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking , WDTN '05, p.259, 2005.
DOI : 10.1145/1080139.1080143

J. Tang, M. Musolesi, C. Mascolo, and V. Latora, Characterising temporal distance and reachability in mobile and online social networks, ACM SIGCOMM Computer Communication Review, vol.40, issue.1, pp.118-124, 2010.
DOI : 10.1145/1672308.1672329

J. Tang, M. Musolesi, C. Mascolo, V. Latora, and V. Nicosia, Analysing information flows and key mediators through temporal centrality metrics, Proceedings of the 3rd Workshop on Social Network Systems, SNS '10, pp.1-6, 2010.
DOI : 10.1145/1852658.1852661

J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora, Small-world behavior in time-varying graphs, Physical Review E, vol.81, issue.5, p.55101, 2010.
DOI : 10.1103/PhysRevE.81.055101

S. Wang, J. L. Torgerson, J. Schoolcraft, and Y. Brenman, The deep impact network experiment operations center monitor and control system, Proceedings of 3rd IEEE international Conference on Space Mission Challenges For information Technology, pp.34-40, 2009.

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-96, 1996.
DOI : 10.1145/62546.62568

X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing, Proceedings of the 13th annual ACM international conference on Mobile computing and networking , MobiCom '07, pp.195-206, 2007.
DOI : 10.1145/1287853.1287876

Z. Zhang, Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges, IEEE Communications Surveys & Tutorials, vol.8, issue.1, pp.24-37, 2006.
DOI : 10.1109/COMST.2006.323440