M. Abu-ata-et-feodor and F. Dragan, Metric tree-like structures in real-life networks : an empirical study. CoRR, abs/1402, 2014.

]. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup, Compact Name-independent Routing with Minimum Stretch, Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '04, pp.20-24, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307619

P. David-auber, M. Mary, J. Mathiaut, A. Dubois, D. Lambert et al., Maylis Delest et Guy Melançon : Tulip : a Scalable Graph Visualization Framework, Sadok Ben Yahia et Jean-Marc Petit, éditeurs : Extraction et Gestion des Connaissances (EGC) 2010, volume RNTI E-19, pp.623-624, 2010.

A. B. Adcock, B. D. Sullivan, O. R. Hernandez, and M. W. Mahoney, Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity, 9th International Workshop on OpenMP, pp.71-83, 2013.
DOI : 10.1007/978-3-642-40698-0_6

[. Bartholomew, The art of peering, BT Technology Journal, vol.18, issue.3, pp.33-39, 2000.
DOI : 10.1049/PBBT001E_ch4

N. Barr, J. Chen, and . Kangasharju, Osnat Mokryn et Yuval Shavitt : Bringing order to BGP : decreasing time and message complexity, pp.368-369, 2007.

H. Bandelt and V. Chepoi, 1-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.2, pp.323-334, 2003.
DOI : 10.1137/S0895480100380902

E. [. Bates, R. Chen, and . Chandra, RFC 4456 : BGP Route Reflection : An Alternative to Full Mesh Internal BGP (IBGP) Rapport technique, 2006.

. Bir and . Bird, The BIRD Internet Routing Daemon

[. Brinkmann, J. H. Koolen, and V. Moulton, On the Hyperbolicity of Chordal Graphs, Annals of Combinatorics, vol.5, issue.1, pp.61-69, 2001.
DOI : 10.1007/s00026-001-8007-7

[. Bandelt and H. M. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.182-208, 1986.
DOI : 10.1016/0095-8956(86)90043-2

. Bibliographie, . Bon, and . Bonfire, Building service testbeds for Future Internet Research and Experimentation

M. Boguñá, F. Papadopoulos, and D. V. Krioukov, Sustaining the Internet with hyperbolic mapping, Nature Communications, vol.16, issue.6, pp.1-18, 2010.
DOI : 10.1038/ncomms1063

A. Berry, R. Pogorelcnik, and G. Simonet, An Introduction to Clique Minimal Separator Decomposition, Algorithms, vol.3, issue.2, pp.197-215, 2010.
DOI : 10.3390/a3020197

URL : https://hal.archives-ouvertes.fr/lirmm-00485851

A. Berry, R. Pogorelcnik, and G. Simonet, Efficient clique decomposition of a graph into its atom graph, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00678702

T. Bu and D. F. Towsley, On Distinguishing between Internet Power Law Topology Generators, INFOCOM, pp.638-647, 2002.

D. Coudert and G. Ducoffe, Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, 2014.
DOI : 10.1137/140954787

URL : https://hal.archives-ouvertes.fr/hal-01070768

F. F. Victor-chepoi, B. Dragan, and . Estellon, Notes on diameters, centers, and approximating trees of ??-hyperbolic geodesic spaces and graphs, Electronic Notes in Discrete Mathematics, vol.31, pp.231-234, 2008.
DOI : 10.1016/j.endm.2008.06.046

F. F. Victor-chepoi, B. Dragan, M. Estellon, and . Habib, Yann Vaxès et Yang Xiang : Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs, Algorithmica, pp.62-65, 2012.

H. William, J. Cunningham, and . Edmonds, A combinatorial decomposition theory, Canadian Journal of Mathematics, vol.32, issue.3, pp.734-765, 1980.

J. Chakerian and S. Holmes, distory : Distance Between Phylogenetic Histories, 2010.

J. Chakerian and S. Holmes, Computational Tools for Evaluating Phylogenetic and Hierarchical Clustering Trees, Journal of Computational and Graphical Statistics, vol.14, issue.2, pp.581-599, 2012.
DOI : 10.1080/10618600.2012.640901

[. Chandy and J. Misra, Distributed Simulation: A Case Study in Design and Verification of Distributed Programs, IEEE Transactions on Software Engineering, vol.5, issue.5, pp.440-452, 1979.
DOI : 10.1109/TSE.1979.230182

E. Cho, S. A. Myers, and J. Leskovec, Friendship and mobility, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.1082-1090, 2011.
DOI : 10.1145/2020408.2020579

D. Coudert, Gromov hyperbolicity of graphs : C source code. http:// www-sop.inria.fr/members, 2014.

H. William and . Cunningham, Decomposition of directed graphs, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.2, pp.214-228, 1982.

[. Biha, B. Kaba, M. Meurs, and E. Sanjuan, Graph Decomposition Approaches for Terminology Graphs, MICAI 2007 : Advances in Artificial Intelligence, pp.883-893, 2007.
DOI : 10.1007/978-3-540-76631-5_84

URL : https://hal.archives-ouvertes.fr/hal-01318619

D. Gianlorenzo, . Angelo, D. Mattia, D. Emidio, V. Frigioni et al., Engineering a new loop-free shortest paths routing algorithm, 11th International Symposium on Experimental Algorithms (SEA2012), pp.123-134, 2012.

Y. Dourisboure and C. , Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2007.
DOI : 10.1016/j.disc.2005.12.060

URL : https://hal.archives-ouvertes.fr/hal-00307800

A. Dress, K. Huber, and J. Koolen, Basic Phylogenetic Combinatorics, 2011.
DOI : 10.1017/CBO9781139019767

M. Fabien-de-montgolfier, L. Soto, and . Viennot, Treewidth and Hyperbolicity of the Internet, 10th IEEE International Symposium on Network Computing and Applications (NCA), pp.25-32, 2011.

[. Duan and S. Pettie, Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths, 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.384-391, 2009.
DOI : 10.1137/1.9781611973068.43

A. Xenofontas, G. F. Dimitropoulos, and . Riley, Large-Scale Simulation Models of BGP, pp.287-294, 2004.

]. F. Dra13 and . Dragan, Tree-Like Structures in Graphs : A Metric Point of View, 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.1-4, 2013.

. Drmsim, A Dynamic Routing Simulator, 2009.

S. Deshpande and B. Sikdar, On the impact of route processing and MRAI timers on bgp convergence times, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., pp.1147-1151, 2004.
DOI : 10.1109/GLOCOM.2004.1378136

[. Duan, Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces, 11th Latin American Theoretical Informatics Symposium (LATIN), pp.285-293, 2014.
DOI : 10.1007/978-3-642-54423-1_25

H. Fournier, A. Ismail, and A. Vigneron, Computing the Gromov hyperbolicity of a discrete metric space. CoRR, abs, 1210.

R. M. Fujimoto, Parallel discrete event simulation, Communications of the ACM, vol.33, issue.10, pp.30-53, 1990.
DOI : 10.1145/84537.84545

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.8064

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

G. Robert and . Gallager, Distributed minimum hop algorithms Rapport technique LIDS-P ; 1175, Massachusetts Institute of Technology. Laboratory for Information and Decision Systems, 1982.

L. Gao, On Inferring Autonomous System Relationships in the Internet, IEEE/ACM Trans. Netw, vol.9, issue.6, pp.733-745, 2001.

. [. Garcia-luna-aceves, Loop-free routing using diffusing computations, IEEE/ACM Transactions on Networking, vol.1, issue.1, pp.130-141, 1993.
DOI : 10.1109/90.222913

[. Glacet, Algorithmes de routage : de la réduction des coûts de communication à la dynamique, Thèse, Université Sciences et Technologies - Bordeaux I, 2013.

B. [. Griffin, Premore : An experimental analysis of BGP convergence time, Ninth International Conference on Network Protocols, pp.53-61, 2001.

L. Gao and J. Rexford, Stable Internet routing without global coordination, ACM SIGMETRICS Performance Evaluation Review, vol.28, issue.1, pp.307-317, 2000.
DOI : 10.1145/345063.339426

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.6928

M. Gromov, Hyperbolic Groups éditeur : Essays in Group Theory, de Mathematical Sciences Research Institute Publications, pp.75-263, 1987.

]. E. How79 and . Howorka, On metric properties of certain clique graphs, Journal of Combinatorial Theory, Series B, vol.27, issue.1, pp.67-74, 1979.

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

L. Hogie and D. Papadimitriou, Issam Tahiri et Frédéric Majorczyk : Simulating Routing Schemes on Large-Scale Topologies, PADS, pp.132-141, 2010.
DOI : 10.1109/pads.2010.5471662

URL : https://hal.inria.fr/inria-00440114/document

G. Huston, M. Rossi, and G. Armitage, A Technique for Reducing BGP Update Announcements through Path Exploration Damping, IEEE Journal on Selected Areas in Communications, vol.28, issue.8
DOI : 10.1109/JSAC.2010.101005

. Imu and . Imunes, Integrated Multiprotocol Network Emulator/Simulator

]. P. Jak11 and . Jakma, Internet-Draft : Revisions to the BGP 'Minimum Route Advertisement Interval' draft-ietf-idr-mrai-dep-04, 2011.

R. David and . Jefferson, Virtual Time, ACM Transactions on Programming Languages and Systems, vol.7, pp.404-425, 1985.

A. Edmond, P. Jonckheere, and . Lohsoonthorn, Geometry of network security, American Control Conference, pp.976-981, 2004.

A. Kumar and J. Delvenne, A new route discovery scheme, 2014.

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

B. Klns-]-adrian-kosowski and . Li, Nicolas Nisse et Karol Suchan : k-Chordal Graphs : from Cops and Robber to Compact Routing via Treewidth

H. Jack, V. Koolen, and . Moulton, Hyperbolic Bridged Graphs, European Journal of Combinatorics, vol.23, issue.6, pp.683-699, 2002.

[. Kennedy, Onuttom Narayan et Iraj Saniee : On the Hyperbolicity of Large-Scale Networks, 1307.

V. Dmitri, F. Krioukov, M. Papadopoulos, and . Kitsak, Amin Vahdat et Marián Boguñá : Hyperbolic geometry of complex networks, Physical Review E, vol.82, issue.3, p.36106, 2010.

. Kpl-+-07-]-b, N. Kaba, G. Pinet, A. Lelandais, A. Sigayret et al., Clustering gene expression data using graph separators, In silico biology, vol.7, issue.4, pp.433-452, 2007.

[. Labovitz and A. Ahuja, Delayed Internet routing convergence, IEEE/ACM Transactions on Networking, vol.9, issue.3, pp.293-306, 2001.
DOI : 10.1109/90.929852

URL : http://athos.rutgers.edu/~rmartin/teaching/fall04/cs552/readings/lab01.pdf

. Lana-]-aurélien-lancin, Algorithms to compute the atom decomposition and the substitutes of a graph

L. François and . Gall, Faster Algorithms for Rectangular Matrix Multiplication, IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.514-523

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

D. Lokshtanov, Finding the longest isometric cycle in a graph, Discrete Applied Mathematics, vol.157, issue.12, pp.2670-2674, 2009.
DOI : 10.1016/j.dam.2008.08.008

M. Robert, D. R. Metcalfe, and . Boggs, Ethernet : Distributed Packet Switching for Local Computer Networks, Commun. ACM, vol.19, issue.7, pp.395-404, 1976.

J. Misra, Distributed discrete-event simulation, ACM Computing Surveys, vol.18, issue.1, pp.39-65, 1986.
DOI : 10.1145/6462.6485

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7859

C. Magnien, M. Latapy, and M. Habib, Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics, vol.13, pp.10-11, 2009.
DOI : 10.1145/1412228.1455266

URL : https://hal.archives-ouvertes.fr/hal-01146069

J. Moy, RFC 2328 : OSPF Version 2. Rapport technique, IETF, 1998. [Net] Netkit : The poor man's system to experiment computer networking
DOI : 10.17487/rfc1247

N. Nisse, I. Rapaport, and K. Suchan, Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs, SIROCCO'09, pp.252-265, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423454

N. Nisse, I. Rapaport, and K. Suchan, Distributed computing of efficient routing schemes in generalized chordal graphs, Theoretical Computer Science, vol.444, pp.17-27, 2012.
DOI : 10.1016/j.tcs.2012.01.006

URL : https://hal.archives-ouvertes.fr/inria-00423454

O. Narayan and I. Saniee, Large-scale curvature of networks, Physical Review E, vol.84, issue.6, p.66108, 2011.
DOI : 10.1103/PhysRevE.84.066108

O. Narayan, I. Saniee, and H. Gabriel, Tucci : Lack of spectral gap and hyperbolicity in asymptotic Erdös-Renyi sparse random graphs, 5th International Symposium on Communications, Control and Signal Processing (ISCCSP), pp.1-4, 2012.

[. Papadopoulos, D. V. Krioukov, M. Boguñá, and A. Vahdat, Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces, 2010 Proceedings IEEE INFOCOM, pp.15-17, 2009.
DOI : 10.1109/INFCOM.2010.5462131

B. Quoitin and S. Uhlig, Modeling the routing of an autonomous system with C-BGP, IEEE Network, vol.19, issue.6, pp.12-19, 2005.
DOI : 10.1109/MNET.2005.1541716

[. Team, R : A Language and Environment for Statistical Computing, 2014.

Y. Rekhter, T. Li, and S. Hares, Rapport technique, IETF, A Border Gateway Protocol, vol.4271, issue.4, 2006.

D. Venugopalan-ramasubramanian, F. Malkhi, M. Kuhn, A. Balakrishnan, A. Gupta et al., On the Treeness of Internet Latency and Bandwidth, ACM SIGMETRICS Performance Evaluation Review, vol.37, issue.1, pp.61-72, 2009.

[. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, Characterizing the Internet hierarchy from multiple vantage points, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.
DOI : 10.1109/INFCOM.2002.1019307

A. Mauricio and . Soto-gómez, Quelques propriétés topologiques des graphes et applications à internet et aux réseaux, Thèse de doctorat, 2011.

R. E. Shannon, Simulation : A Survey with Research Suggestions. A I I E Transactions, pp.289-301, 1975.
DOI : 10.1080/05695557508975433

Y. Shang, Lack of Gromov-Hyperbolicity in Colored Random Networks, PanAmerican Mathematical Journal, vol.21, issue.1, pp.27-36, 2011.

Y. Shavitt and E. Shir, DIMES, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.71-74, 2005.
DOI : 10.1145/1096536.1096546

. Ssf and . Ssfnet, Scalable Simulation Framework (SSF)

. Robert-endre-tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

. Robert-endre-tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2

[. Tang, G. Zhang, T. Lin, and J. Liu, HDLBR: A name-independent compact routing scheme for power-law networks, Computer Communications, vol.36, issue.3, pp.351-359, 2013.
DOI : 10.1016/j.comcom.2012.09.009

. Ulk and . Ulk, The User-mode Linux Kernel

. Vnu and . Vnuml, Vitual Network User Mode Linux

. Vnx and . Vnx, Virtual Networks over Linux

Y. Wu and C. Zhang, Hyperbolicity and Chordality of a Graph, The Electronic Journal of Combinatorics, vol.18, issue.1, p.43, 2011.

F. F. Ata and . Dragan, Metric tree-like structures in real-life networks: an empirical study, 2014.

B. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM (JACM), vol.1, issue.4 1

H. Bandelt and V. Chepoi, Metric graph theory and geometry: a survey, Contemporary Mathematics
DOI : 10.1090/conm/453/08795

H. Bandelt and H. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2
DOI : 10.1016/0095-8956(86)90043-2

S. Bermudo, J. Rodríguez, J. Sigarreta, and J. Vilaire, Gromov hyperbolic graphs, Discrete Mathematics, vol.313, issue.15
DOI : 10.1016/j.disc.2013.04.009

A. Berry, R. Pogorelcnik, and G. Simonet, Efficient clique decomposition of a graph into its atom graph, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00678702

A. Berry, R. Pogorelcnik, and G. Simonet, An Introduction to Clique Minimal Separator Decomposition, Algorithms, vol.3, issue.2
DOI : 10.3390/a3020197

URL : https://hal.archives-ouvertes.fr/lirmm-00485851

H. L. Bodlaender, Discovering Treewidth, 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM),v o l u m e3 3 8 1o fLecture Notes in Computer Science, pp.1-1
DOI : 10.1007/978-3-540-30577-4_1

M. Boguñá, F. Papadopoulos, and D. V. Krioukov, Sustaining the Internet with hyperbolic mapping, Nature Communications, vol.16, issue.6, pp.1-1
DOI : 10.1038/ncomms1063

J. A. Bondy and U. Murty, Graph theory with applications,v olume290.MacmillanLondon, 1976.

G. Brinkmann, J. H. Koolen, and V. Moulton, On the Hyperbolicity of Chordal Graphs, Annals of Combinatorics, vol.5, issue.1, pp.6-7
DOI : 10.1007/s00026-001-8007-7

J. Chakerian and S. Holmes, Computational Tools for Evaluating Phylogenetic and Hierarchical Clustering Trees, Journal of Computational and Graphical Statistics, vol.14, issue.2, pp.5-8, 2012.
DOI : 10.1080/10618600.2012.640901

V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, Notes on diameters, centers, and approximating trees of ??-hyperbolic geodesic spaces and graphs, Electronic Notes in Discrete Mathematics, vol.31
DOI : 10.1016/j.endm.2008.06.046

N. Cohen, D. Coudert, and A. Lancin, Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00735481

D. Coudert and G. Ducoffe, Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, 2014.
DOI : 10.1137/140954787

URL : https://hal.archives-ouvertes.fr/hal-01070768

W. H. Cunningham, Decomposition of Directed Graphs, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.2
DOI : 10.1137/0603021

P. De, L. Harp-e, and E. Ghys, Sur les groupes hyperboliques d'après Mikhael Gromov,v o l ume 83, 1990.

M. D. Biha, B. Kaba, M. Meurs, and E. Sanjuan, Graph decomposition approaches for terminology graphs, MICAI 2007: Advances in Artificial Intelligence,v o l u m e4 8 2 7 of Lecture Notes in Computer Science
URL : https://hal.archives-ouvertes.fr/hal-01318619

Y. Dourisboure and C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16
DOI : 10.1016/j.disc.2005.12.060

URL : https://hal.archives-ouvertes.fr/hal-00307800

F. Dragan, Tree-Like Structures in Graphs: A Metric Point of View, 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG),volume8165ofLecture Notes in Computer Science, pp.1-4
DOI : 10.1007/978-3-642-45043-3_1

A. Dress, K. Huber, J. Koolen, V. Moulton, and A. Spillner, Basic Phylogenetic Combinatorics, 2011.
DOI : 10.1017/CBO9781139019767

H. Fournier, A. Ismail, and A. Vigneron, Computing the Gromov hyperbolicity of a discrete metric space, Information Processing Letters, vol.115, issue.6-8, 2012.
DOI : 10.1016/j.ipl.2015.02.002

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

F. Gavril, Algorithms on clique separable graphs, Discrete Mathematics, vol.19, issue.2, pp.1-5, 1977.
DOI : 10.1016/0012-365X(77)90030-9

URL : http://doi.org/10.1016/0012-365x(77)90030-9

M. Gromov, Hyperbolic Groups, Essays in Group Theory,v olum e8of Mathematical Sciences Research Institute Publications, 1987.
DOI : 10.1007/978-1-4613-9586-7_3

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

E. Howorka, On metric properties of certain clique graphs, Journal of Combinatorial Theory, Series B, vol.27, issue.1, pp.6-7, 1979.
DOI : 10.1016/0095-8956(79)90069-8

E. A. Jonckheere and P. Lohsoonthorn, Geometry of network security, American Control Conference, pp.976-981, 2004.

B. Kaba, N. Pinet, G. Lelandais, A. Sigayret, and A. Berry, Clustering gene expression data using graph separators, In silico biology, vol.7, issue.4

W. S. Kennedy, O. Narayan, and I. Saniee, On the hyperbolicity of large-scale networks, 2013.

J. H. Koolen and V. Moulton, Hyperbolic Bridged Graphs, European Journal of Combinatorics, vol.23, issue.6
DOI : 10.1006/eujc.2002.0591

URL : http://doi.org/10.1006/eujc.2002.0591

L. Gall, Faster Algorithms for Rectangular Matrix Multiplication, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.514-523
DOI : 10.1109/FOCS.2012.80

H. Leimer, Optimal decomposition by clique separators, Discrete Mathematics, vol.113, issue.1-3, pp.99-123, 1993.
DOI : 10.1016/0012-365X(93)90510-Z

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

S. Mccullough, 2 ??? Chordal Graphs, Contributions to Operator Theory and its Applications, pp.143-192, 1988.
DOI : 10.1007/978-3-0348-9284-1_7

S. Mccullough, Minimal separators of 2-chordal graphs. Linear algebra and its applications, pp.187-199, 1993.

K. Olesen and A. Madsen, Maximal prime subgraph decomposition of Bayesian networks, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.32, issue.1, pp.2-3, 2002.
DOI : 10.1109/3477.979956

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, p.6
DOI : 10.1137/0216062

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

M. A. Soto-gómez, Quelques propriétés topologiques des graphes et applications à internet et aux réseaux.P h Dt h e s i s ,U n i v .P a r i sD i d e r o t( P a r i s7

M. Sys?o, Characterizations of outerplanar graphs, Discrete Mathematics, vol.26, issue.1, pp.4-7, 1979.
DOI : 10.1016/0012-365X(79)90060-8

R. Tamassia and I. Tollis, Planar grid embedding in linear time, IEEE Transactions on Circuits and Systems, vol.36, issue.9
DOI : 10.1109/31.34669

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.2-2, 1985.
DOI : 10.1016/0012-365X(85)90051-2

Y. Wu and C. Zhang, Hyperbolicity and chordality of a graph, The Electronic Journal of Combinatorics, vol.8, issue.1 1