D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, On the bias of traceroute sampling: or, power-law degree distributions in regular graphs, Bibliography J. ACM, vol.56, issue.4, 2009.

L. Alonso and R. Schott, Random Generation of Trees, 1995.
DOI : 10.1007/978-1-4757-6353-9

A. Apostolico and G. Drovandi, Graph Compression by BFS, Algorithms, vol.2, issue.3, pp.1031-1044, 2009.
DOI : 10.1145/321812.321820
URL : https://doi.org/10.3390/a2031031

Y. Asano, T. Ito, H. Imai, M. Toyoda, and M. Kitsuregawa, Compact Encoding of the Web Graph Exploiting Various Power Laws, 4th International Conference on Advances in Web-Age Information Management, pp.37-46, 2003.
DOI : 10.1007/978-3-540-45160-0_5

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

H. Baumann, P. Crescenzi, and P. Fraigniaud, Parsimonious flooding in dynamic graphs, Distributed Computing, pp.31-44, 2011.
DOI : 10.1145/1582716.1582757
URL : http://aeolus.ceid.upatras.gr/scientific-reports/4th-year-reports/podc74-baumann.pdf

A. Edward, E. R. Bender, and . Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.

P. Boldi and S. Vigna, The webgraph framework I, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.595-602, 2004.
DOI : 10.1145/988672.988752

B. Bollobás, S. Janson, and O. Riordan, Sparse random graphs with clustering. Random Structures and Algorithms, pp.269-323, 2011.

U. Brandes, M. Hamann, B. Strasser, and D. Wagner, Fast Quasi-Threshold Editing, Algorithms (ESA 2015), pp.251-262, 2015.
DOI : 10.1016/0166-218X(96)00094-7

F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi et al., On compressing social networks, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.219-228, 2009.
DOI : 10.1145/1557019.1557049

A. Clauset, C. R. Shalizi, and M. Newman, Power-Law Distributions in Empirical Data, SIAM Review, vol.51, issue.4, pp.661-703, 2009.
DOI : 10.1137/070710111

E. F. Andrea, C. Clementi, A. Macci, F. Monti, R. Pasquale et al., Flooding time in edge-markovian dynamic graphs, 27th ACM symposium on Principles of distributed computing, pp.213-222, 2008.

C. Rivest and . Stein, Introduction to Algorithms, 2009.

C. Crespelle and P. Gambette, Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search, 20th International Workshop on Combinatorial Algorithms, pp.146-157, 2009.
DOI : 10.1007/978-3-642-10217-2_17

C. Crespelle and P. Gambette, Unrestricted and complete Breadth-First Search of trapezoid graphs in time, Information Processing Letters, vol.110, issue.12-13, pp.12-13497, 2010.
DOI : 10.1016/j.ipl.2010.03.015
URL : https://hal.archives-ouvertes.fr/lirmm-00469844

C. Crespelle and P. Gambette, Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs, 7th International Workshop on Algorithms and Computation, pp.126-136, 2013.
DOI : 10.1007/978-3-642-36065-7_13
URL : https://hal.archives-ouvertes.fr/hal-00755257

C. Crespelle and P. Gambette, (Nearly-)tight bounds on the contiguity and linearity of cographs, Theoretical Computer Science, vol.522, pp.1-12, 2014.
DOI : 10.1016/j.tcs.2013.11.036
URL : https://hal.archives-ouvertes.fr/hal-00730247

C. Crespelle, M. Latapy, and T. Phan, On the termination of some biclique operators on multipartite graphs, Discrete Applied Mathematics, vol.195, pp.59-73, 2015.
DOI : 10.1016/j.dam.2015.02.006
URL : https://hal.archives-ouvertes.fr/hal-01200865

C. Crespelle, M. Latapy, and E. Rotenberg, Rigorous Measurement of IP-Level Neighborhood of Internet Core Routers, 2010 INFOCOM IEEE Conference on Computer Communications Workshops, pp.1-6, 2010.
DOI : 10.1109/INFCOMW.2010.5466707
URL : https://hal.archives-ouvertes.fr/hal-00925782

C. Crespelle, T. Le, K. Perrot, and T. Phan, Linearity is strictly more powerful than contiguity for encoding graphs, 14th International Symposium on Algorithms and Data Structures, pp.212-223, 2015.
DOI : 10.1007/978-3-319-21840-3_18
URL : https://hal.archives-ouvertes.fr/hal-01424428

C. Crespelle, T. Le, K. Perrot, and T. Phan, Linearity is strictly more powerful than contiguity for encoding graphs, Discrete Mathematics, vol.339, issue.8, pp.2168-2177, 2016.
DOI : 10.1016/j.disc.2016.03.006
URL : https://hal.archives-ouvertes.fr/hal-01424428

C. Crespelle, D. Lokshtanov, T. H. , D. Phan, and E. Thierry, Faster and enhanced inclusionminimal cograph completion, 11th International Conference on Combinatorial Optimization and Applications (COCOA 2017), number 10627 (Part I) in LNCS, pp.1-15, 2017.
DOI : 10.1007/978-3-319-71150-8_19
URL : https://hal.archives-ouvertes.fr/hal-01672076

C. Crespelle, A. Perez, and I. Todinca, An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem, 41st International Workshop on Graph- Theoretic Concepts in Computer Science, pp.103-115, 2015.
DOI : 10.1137/0602010

C. Crespelle, T. H. , D. Phan, and T. Tran, Termination of the iterated strong-factor operator on multipartite graphs, Theoretical Computer Science, vol.571, pp.67-77, 2015.
DOI : 10.1016/j.tcs.2015.01.009
URL : https://hal.archives-ouvertes.fr/hal-01241925

C. Crespelle and F. Tarissan, Evaluation of a new method for measuring the internet degree distribution: Simulation results, Computer Communications, vol.34, issue.5, pp.635-648, 2011.
DOI : 10.1016/j.comcom.2010.06.006
URL : https://hal.archives-ouvertes.fr/hal-01146072

C. Crespelle and I. Todinca, An O(n 2 )-time algorithm for the minimal interval completion problem, 7th Annual Conference on Theory and Applications of Models of Computation number 6108 in LNCS, pp.175-186, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00480750

C. Crespelle and I. Todinca, -time algorithm for the minimal interval completion problem, Theoretical Computer Science, vol.494, pp.75-85, 2013.
DOI : 10.1016/j.tcs.2012.12.031

N. Sergey, J. F. Dorogovtsev, A. N. Mendes, and . Samukhin, Size-dependent degree distribution of a scale-free growing network, Phys. Rev. E, vol.63, issue.6, p.62101, 2001.

P. Erdös and A. Rényi, On the evolution of random graphs, Math. Inst. Hung. Acad. Sci, vol.5, pp.17-61, 1960.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, ACM SIGCOMM Conference on Applications, Technologies , Architectures, and Protocols for Computer Communication (SIGCOMM 1999), pp.251-262, 1999.

J. P. Gleeson, Bond percolation on a class of clustered random networks, Physical Review E, vol.6, issue.3, p.36107, 2009.
DOI : 10.1103/PhysRevE.70.056122

P. W. Goldberg, M. C. Golumbic, H. Kaplan, and R. Shamir, Four Strikes Against Physical Mapping of DNA, Journal of Computational Biology, vol.2, issue.1, pp.139-152, 1995.
DOI : 10.1089/cmb.1995.2.139

S. Mark and . Granovetter, The strength of weak ties, American Journal of Sociology, vol.78, issue.6, pp.1360-1380, 1973.

J. Guillaume and M. Latapy, Bipartite structure of all complex networks, Information Processing Letters, vol.90, issue.5, pp.215-221, 2004.
DOI : 10.1016/j.ipl.2004.03.007
URL : https://hal.archives-ouvertes.fr/hal-00016855

J. Guillaume and M. Latapy, Bipartite graphs as models of complex networks, Physica A: Statistical Mechanics and its Applications, vol.371, issue.2, pp.795-813, 2006.
DOI : 10.1016/j.physa.2006.04.047
URL : http://www-rp.lip6.fr/~latapy/Publis/bipartite.pdf

C. Heaukulani and Z. Ghahramani, Dynamic probabilistic models for latent feature propagation in social networks, 30th International Conference on Machine Learning (ICML 13) Conference Proceedings, pp.275-283, 2013.

P. Heggernes, J. A. Telle, and Y. Villanger, Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376), SIAM Journal on Discrete Mathematics, vol.19, issue.4, pp.900-913, 2005.
DOI : 10.1137/S0895480104445010

P. Holme and B. Kim, Growing scale-free networks with tunable clustering, Physical Review E, vol.63, issue.2, p.26107, 2002.
DOI : 10.1103/PhysRevE.63.062101

H. Jeong, S. P. Mason, A. Barabási, and Z. N. Oltvai, Lethality and centrality in protein networks, Nature, vol.28, issue.6833, pp.41-42, 2001.
DOI : 10.1093/nar/28.1.73

S. Jia, L. Gao, Y. Gao, J. Nastos, Y. Wang et al., Defining and identifying cograph communities in complex networks, New Journal of Physics, vol.17, issue.1, p.13044, 2015.
DOI : 10.1088/1367-2630/17/1/013044
URL : http://iopscience.iop.org/article/10.1088/1367-2630/17/1/013044/pdf

J. Kleinberg, The small-world phenomenon, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.163-170, 2000.
DOI : 10.1145/335305.335325

R. Kumar, P. Raghavan, D. Sridhar-rajagopalan, A. Sivakumar, E. Tomkins et al., Stochastic models for the Web graph, Proceedings 41st Annual Symposium on Foundations of Computer Science, p.57, 2000.
DOI : 10.1109/SFCS.2000.892065

A. Lakhina, J. W. Byers, M. Crovella, and P. Xie, Sampling biases in IP topology measurements, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003.
DOI : 10.1109/INFCOM.2003.1208685

M. Latapy, T. H. Duong-phan, C. Crespelle, and T. Q. Nguyen, Termination of Multipartite Graph Series Arising from Complex Network Modelling, 4th International Conference on Combinatorial Optimization and Applications (COCOA 2010), number 6508 (Part I) in LNCS, pp.1-10, 2010.
DOI : 10.1038/30918
URL : https://hal.archives-ouvertes.fr/hal-00644239

M. Latapy, E. Rotenberg, C. Crespelle, and F. Tarissan, Measuring the degree distribution of routers in the core internet, 2014 IFIP Networking Conference, pp.1-9, 2014.
DOI : 10.1109/IFIPNetworking.2014.6857096
URL : https://hal.archives-ouvertes.fr/hal-01208359

M. Latapy, E. Rotenberg, C. Crespelle, and F. Tarissan, Rigorous measurement of the Internet degree distribution, Complex Systems, vol.26, issue.1, p.2017
URL : https://hal.archives-ouvertes.fr/hal-01500371

G. Laurent, J. Saramäki, and M. Karsai, From calls to communities: a model for time-varying social networks, The European Physical Journal B, vol.1, issue.11, p.301, 2015.
DOI : 10.1371/journal.pcbi.1001109
URL : https://hal.archives-ouvertes.fr/hal-01203177

Y. Léo, C. Crespelle, and E. Fleury, Nonaltering time scales for aggregation of dynamic networks into series of graphs

Y. Léo, C. Crespelle, and E. Fleury, Nonaltering time scales for aggregation of dynamic networks into series of graphs, 11th ACM Conference on emerging Networking EXperiments and Technologies, pp.1-297, 2015.

X. Li, D. Leonard, and D. Loguinov, On Reshaping of Clustering Coefficients in Degree-Based Topology Generators, 3rd International Workshop on Algorithms and Models for the Web-Graph, pp.68-79, 2004.
DOI : 10.1073/pnas.172501399

D. Lokshtanov, F. Mancini, and C. Papadopoulos, Characterizing and computing minimal cograph completions, Discrete Applied Mathematics, vol.158, issue.7, pp.755-764, 2010.
DOI : 10.1016/j.dam.2009.01.016
URL : http://www.ii.uib.no/~federico/papers/cographcompl.pdf

M. Jean-loup-guillaume, L. Latapy, and . Viennot, Efficient and simple encodings for the web graph, 3rd International Conference on Web-Age Information Management, pp.328-337, 2002.

M. Marsili, F. Vega-redondo, and F. Slanina, The rise and fall of a networked society: A formal model, Proceedings of the National Academy of Sciences, vol.61, issue.16, pp.1439-1442, 2004.
DOI : 10.2307/2951551

L. Martinet, C. Crespelle, and E. Fleury, Dynamic Contact Network Analysis in Hospital Wards, 5th Workshop on Complex Networks number 549 in Studies in Computational Intelligence, pp.241-249, 2014.
DOI : 10.1007/978-3-319-05401-8_23
URL : https://hal.archives-ouvertes.fr/hal-01104058

L. Martinet, C. Crespelle, E. Fleury, P. Boëlle, and D. Guillemot, The dynamic contact network of a whole hospital

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, vol.3, issue.2-3, pp.161-180, 1995.
DOI : 10.1002/rsa.3240030202
URL : http://www.cs.toronto.edu/~molloy/webpapers/gc2.ps

J. Moody, The Importance of Relationship Timing for Diffusion, Social Forces, vol.81, issue.1, pp.25-56, 2002.
DOI : 10.1353/sof.2002.0056

V. Neiger, C. Crespelle, and E. Fleury, On the Structure of Changes in Dynamic Contact Networks, 2012 Eighth International Conference on Signal Image Technology and Internet Based Systems, pp.731-738, 2012.
DOI : 10.1109/SITIS.2012.111
URL : https://hal.archives-ouvertes.fr/hal-00755251

M. Newman, D. J. Watts, and S. H. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences, vol.64, issue.11, pp.2566-2572, 2002.
DOI : 10.1016/0049-089X(78)90006-6

J. Pansiot and D. Grad, On routes and multicast trees in the Internet, ACM SIGCOMM Computer Communication Review, vol.28, issue.1, 1998.
DOI : 10.1145/280549.280555

N. Perra and B. Gonçalves, Activity driven modeling of time varying networks, Scientific Reports, vol.105, issue.1, p.469, 2012.
DOI : 10.1103/PhysRevLett.105.218701

A. R. Rao, R. Jana, and S. Bandyopadhyay, A markov chain monte carlo method for generating random (0, 1)-matrices with given marginals. Sankhy¯ a: The Indian Journal of Statistics, pp.58225-242, 1961.

B. Ribeiro, N. Perra, and A. Baronchelli, Quantifying the effect of temporal resolution on timevarying networks, Scientific Reports, vol.3, 2013.

D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.146-160, 1976.
DOI : 10.1137/0205021

E. Rotenberg, C. Crespelle, and M. Latapy, Measuring routing tables in the internet, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.795-800, 2014.
DOI : 10.1109/INFCOMW.2014.6849332
URL : https://hal.archives-ouvertes.fr/hal-01211167

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

Á. Serrano and M. Boguñá, Tuning clustering in random networks with arbitrary degree distributions, Physical Review E, vol.68, issue.3, p.36133, 2005.
DOI : 10.1103/PhysRevE.68.015101

A. B. Tom, G. G. Snijders, C. E. Van-de-bunt, and . Steglich, Introduction to stochastic actor-based models for network dynamics, Social Networks, vol.32, issue.1, pp.44-60, 2010.

K. Suchan and I. Todinca, Minimal interval completion through graph exploration, Theoretical Computer Science, vol.410, issue.1, pp.35-43, 2009.
DOI : 10.1016/j.tcs.2008.09.053
URL : https://hal.archives-ouvertes.fr/hal-00462293

R. Sulo, T. Berger-wolf, and R. Grossman, Meaningful selection of temporal resolution for dynamic networks, Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, pp.127-136, 2010.
DOI : 10.1145/1830252.1830269

J. Travers and S. Milgram, An Experimental Study of the Small World Problem, Sociometry, vol.32, issue.4, pp.425-443, 1969.
DOI : 10.2307/2786545

G. Turan, On the succinct representation of graphs, Discrete Applied Mathematics, vol.8, issue.3, pp.289-294, 1984.
DOI : 10.1016/0166-218X(84)90126-4

E. Volz, Random networks with tunable degree distribution and clustering, Physical Review E, vol.9, issue.5, p.56115, 2004.
DOI : 10.1890/0012-9658(2003)084[0882:EOSDOM]2.0.CO;2

J. Duncan, S. H. Watts, and . Strogatz, Collective dynamics of small-world networks, Nature, vol.393, pp.440-442, 1998.

C. Witt, Greedy Local Search and Vertex Cover in Sparse Random Graphs, 6th Annual Conference on Theory and Applications of Models of Computation, pp.410-419, 2009.
DOI : 10.1007/978-3-642-02017-9_43

X. Zhang, C. Moore, and M. Newman, Random graph models for dynamic networks, The European Physical Journal B, vol.89, issue.10, p.200, 2017.
DOI : 10.1140/epjb/e2015-60366-0