Self-dual configurations and regular graphs. Bulletin of the, pp.413-455, 1950. ,
Bounds on directed (d, k) graphs. Theory of cellular logic networks and machines. AFCRL-68-0668, SRI Project 7258, pp.20-28, 1968. ,
Bounds for sorting by prefix reversal, Discrete Mathematics, vol.27, issue.1, pp.47-57, 1979. ,
DOI : 10.1016/0012-365X(79)90068-2
The cube-connected cycles: a versatile network for parallel computation, Communications of the ACM, vol.24, issue.5, pp.300-309, 1981. ,
DOI : 10.1145/358645.358660
Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, pp.235-239, 1983. ,
DOI : 10.1016/0012-365X(83)90160-7
Probì emes de jeux, de point fixe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes, 1983. ,
A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984. ,
DOI : 10.1016/0166-218X(84)90073-8
Generalized Hypercube and Hyperbus Structures for a Computer Network, IEEE Transactions on Computers, vol.33, issue.4, pp.323-333, 1984. ,
DOI : 10.1109/TC.1984.1676437
Eccentric graphs, Discrete Mathematics, vol.56, issue.1, pp.1-6, 1985. ,
DOI : 10.1016/0012-365X(85)90188-8
Hyperbolic groups. Essays in Group Theory, pp.75-263, 1987. ,
A survey of the theory of hypercube graphs, Computers & Mathematics with Applications, vol.15, issue.4, pp.277-289, 1988. ,
DOI : 10.1016/0898-1221(88)90213-1
A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, vol.38, issue.4, pp.555-566, 1989. ,
DOI : 10.1109/12.21148
De Bruijn and Kautz networks: a competitor for the hypercube?, European Workshop on Hypercubes and Distributed Computers, pp.279-293, 1989. ,
Self-Centered Graphs, Annals of the New York Academy of Sciences, vol.4, issue.3, pp.71-78, 1989. ,
DOI : 10.1016/0012-365X(83)90271-6
Broadcasting and Gossiping in de Bruijn Networks, SIAM Journal on Computing, vol.23, issue.1, pp.212-225, 1994. ,
DOI : 10.1137/S0097539791197852
Automatic structures, rational growth, and geometrically finite hyperbolic groups, Inventiones Mathematicae, vol.3, issue.1, pp.259-287, 1995. ,
DOI : 10.1007/BF01241129
Transposition networks as a class of fault-tolerant robust networks, IEEE Transactions on Computers, vol.45, issue.2, pp.230-238, 1996. ,
DOI : 10.1109/12.485375
Folded Petersen cube networks: new competitors for the hypercubes, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.2, pp.151-168, 1996. ,
DOI : 10.1109/71.485505
The diameter of the cube-connected cycles, Information Processing Letters, vol.61, issue.3, pp.157-160, 1997. ,
DOI : 10.1016/S0020-0190(97)00013-6
k-ary n-trees: high performance networks for massively parallel architectures, Proceedings 11th International Parallel Processing Symposium, pp.87-93, 1997. ,
DOI : 10.1109/IPPS.1997.580853
Expanders are not hyperbolic, Israel Journal of Mathematics, vol.8, issue.1, pp.33-36, 1998. ,
DOI : 10.1007/BF02783040
Graph automorphisms with maximal projection distances, Fundamentals of Computation Theory, pp.204-214, 1999. ,
DOI : 10.1007/3-540-48321-7_16
On embedding trees into uniformly convex Banach spaces, Israel Journal of Mathematics, vol.93, issue.1, pp.221-237, 1999. ,
DOI : 10.1007/BF02785579
Shortest path routing and fault-tolerant routing on de Bruijn networks, Networks, vol.40, issue.3, pp.207-215, 2000. ,
DOI : 10.1002/(SICI)1097-0037(200005)35:3<207::AID-NET4>3.0.CO;2-F
On the Hyperbolicity of Chordal Graphs, Annals of Combinatorics, vol.5, issue.1, pp.61-69, 2001. ,
DOI : 10.1007/s00026-001-8007-7
Geometric group theory. Handbook of geometric topology, pp.261-305, 2002. ,
Isomorphisms of the De Bruijn digraph and free-space optical networks, Networks, vol.60, issue.3, pp.155-164, 2002. ,
DOI : 10.1002/net.10043
URL : https://hal.archives-ouvertes.fr/inria-00429201
Hyperbolic Bridged Graphs, European Journal of Combinatorics, vol.23, issue.6, pp.683-699, 2002. ,
DOI : 10.1006/eujc.2002.0591
Weakly symmetric graphs and their endomorphism monoids, Southeast Asian Bulletin of Mathematics, vol.27, issue.3, 2003. ,
Novel hierarchical interconnection networks for high-performance multicomputer systems, Journal of information science and engineering, vol.20, pp.1213-1229, 2004. ,
Algorithms on negatively curved spaces, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.119-132, 2006. ,
DOI : 10.1109/FOCS.2006.9
Packing and Covering ??-Hyperbolic Spaces by Balls, Approximation , Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp.59-73, 2007. ,
DOI : 10.1007/978-3-540-74208-1_5
Geographic Routing Using Hyperbolic Space, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1902-1909, 2007. ,
DOI : 10.1109/INFCOM.2007.221
Mobility of vertex-transitive graphs, Discrete Mathematics, vol.307, issue.3-5, pp.579-591, 2007. ,
DOI : 10.1016/j.disc.2005.09.046
Biswapped Networks and Their Topological Properties, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), pp.193-198, 2007. ,
DOI : 10.1109/SNPD.2007.217
A scalable, commodity data center network architecture, ACM SIGCOMM Computer Communication Review, vol.38, issue.4, pp.63-74, 2008. ,
DOI : 10.1145/1402946.1402967
Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs, 24th Symposium on Computational Geometry (SCG), pp.59-68, 2008. ,
Dcell, ACM SIGCOMM Computer Communication Review, vol.38, issue.4, pp.75-86, 2008. ,
DOI : 10.1145/1402946.1402968
BCube, ACM SIGCOMM Computer Communication Review, vol.39, issue.4, pp.63-74, 2009. ,
DOI : 10.1145/1594977.1592577
FiConn: Using Backup Port for Server Interconnection in Data Centers, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2276-2285, 2009. ,
DOI : 10.1109/INFCOM.2009.5062153
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
MDCube, Proceedings of the 5th international conference on Emerging networking experiments and technologies, CoNEXT '09, pp.25-36, 2009. ,
DOI : 10.1145/1658939.1658943
Chordality and hyperbolicity of a graph, 2009. ,
Sustaining the Internet with Hyperbolic Mapping, Nature Communications, vol.1, issue.62, 2010. ,
Generalized DCell structure for loadbalanced data center networks, INFOCOM IEEE Conference on Computer Communications Workshops, pp.1-5, 2010. ,
Fault-Tolerant Routing in Butterfly Networks, Journal of Applied Sciences, vol.10, issue.11, pp.903-908, 2010. ,
DOI : 10.3923/jas.2010.903.908
Overlay addressing and routing system based on hyperbolic geometry, 2011 IEEE Symposium on Computers and Communications (ISCC), pp.294-301, 2011. ,
DOI : 10.1109/ISCC.2011.5983793
URL : https://hal.archives-ouvertes.fr/hal-00653766
Cop and Robber Games When the Robber Can Hide and Ride, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.333-359, 2011. ,
DOI : 10.1137/100784035
URL : https://hal.archives-ouvertes.fr/inria-00482117
Preferential attachment in growing spatial networks, Physical Review E, vol.84, issue.1, 2011. ,
DOI : 10.1103/PhysRevE.84.016103
Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks, Internet Mathematics, vol.7, issue.1, pp.1-27, 2011. ,
DOI : 10.1080/15427951.2010.554320
Quelques propriétés topologiques des graphes et applicationsàapplicationsà internet et aux réseaux, 2011. ,
Hyperbolicity and chordality of a graph, The Electronic Journal of Combinatorics, vol.18, issue.1, 2011. ,
Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze, Geometric aspects of functional analysis, pp.123-126, 2012. ,
DOI : 10.1007/978-3-642-29849-3_5
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00735481
Lack of spectral gap and hyperbolicity in asymptotic erdös-renyi sparse random graphs, International Symposium on Communications Control and Signal Processing (ISCCSP), pp.1-4, 2012. ,
Popularity versus similarity in growing networks, Nature, vol.453, issue.7417, pp.489537-540, 2012. ,
DOI : 10.1038/nature11459
Bounds on Gromov hyperbolicity constant in graphs, Proceedings Indian Acad. Sci. (Mathematical Sciences), pp.53-65, 2012. ,
DOI : 10.1007/s12044-012-0060-0
A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY, Parallel Processing Letters, vol.22, issue.04, pp.22-2012 ,
DOI : 10.1142/S0129626412500132
Tree-Like Structure in Large Social and Information Networks, 2013 IEEE 13th International Conference on Data Mining, pp.1-10, 2013. ,
DOI : 10.1109/ICDM.2013.77
On the Hyperbolicity of Small-World and Treelike Random Graphs, Internet Mathematics, vol.9, issue.4, pp.434-491, 2013. ,
DOI : 10.1080/15427951.2013.828336
On the hyperbolicity of large-scale networks, 2013. ,
Topological implications of negative curvature for biological and social networks, Physical Review E, vol.89, issue.3, p.32811, 2014. ,
DOI : 10.1103/PhysRevE.89.032811
Geometric Routing With Word-Metric Spaces, IEEE Communications Letters, vol.18, issue.12, pp.182125-2128, 2014. ,
DOI : 10.1109/LCOMM.2014.2364213
Viì a. Efficient routing in Data Center with underlying Cayley graph, Complex Networks V, pp.189-197, 2014. ,
Cayley-Graph-Based Data Centers and Space Requirements of a Routing Scheme Using Automata, 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops, pp.63-69, 2014. ,
DOI : 10.1109/ICDCSW.2014.29
Applying cliquedecomposition for computing Gromov hyperbolicity, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00989024
DCen: A dual-ports and cost-effective network architecture for modular datacenters, Journal of Computational Information Systems, vol.10, issue.13, pp.5697-5704, 2014. ,
On the hyperbolicity of random graphs, The Electronic Journal of Combinatorics, vol.21, issue.2, pp.2-39 ,
URL : https://hal.archives-ouvertes.fr/hal-01143661
Metric embedding, hyperbolic space, and social networks, Annual Symposium on Computational Geometry (SCG), pp.501-510, 2014. ,
Core-periphery models for graphs based on their ?hyperbolicity: An example using biological networks, Complex Networks VI, pp.65-77, 2015. ,
Hyperbolicity measures democracy in real-world networks, Physical Review E, vol.92, issue.3, p.92, 2015. ,
DOI : 10.1103/PhysRevE.92.032812
Viì a. As yet untitled paper. in preparation, 2015. ,
On Computing the Gromov Hyperbolicity, Journal of Experimental Algorithmics, vol.20, issue.1, pp.1-6, 2015. ,
DOI : 10.1145/2780652
URL : https://hal.archives-ouvertes.fr/hal-01182890
,??)???Hyperbolic Spaces, Internet Mathematics, vol.11, issue.2, pp.134-142, 2015. ,
DOI : 10.1080/15427951.2014.884513
Expanders are order diameter non-hyperbolic, 2015. ,
Metric tree-like structures in real-world networks: an empirical study, Networks, vol.18, issue.1, pp.49-69, 2016. ,
DOI : 10.1002/net.21631
To approximate treewidth, use treelength! SIAM, Journal of Discrete Mathematics, 2016. ,
Graph theory, 2008. ,
DOI : 10.1007/978-1-84628-970-5
Communications dans les réseaux de processeurs, 1994. ,