Core congestion is inherent in hyperbolic networks

DOI10.1137/1.9781611974782.149zbMath1410.68031arXiv1605.03059OpenAlexW2963518458MaRDI QIDQ4575897

Yann Vaxès, Feodor F. Dragan, Victor Chepoi

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03059

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Helly-type theorems and geometric transversal theory (52A35)

Related Items (16)

The hyperbolicity constant of infinite circulant graphs ⋮ Obstructions to a small hyperbolicity in Helly graphs ⋮ Injective hulls of various graph classes ⋮ Applying clique-decomposition for computing Gromov hyperbolicity ⋮ Fast approximation and exact computation of negative curvature parameters of graphs ⋮ Eccentricity terrain of \(\delta\)-hyperbolic graphs ⋮ Coarse injectivity, hierarchical hyperbolicity and semihyperbolicity ⋮ Projection complexes and quasimedian maps ⋮ Discrete groups of packed, non-positively curved, Gromov hyperbolic metric spaces ⋮ Gromov hyperbolicity in the Cartesian sum of graphs ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Kirszbraun-type theorems for graphs ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Gromov hyperbolicity in Mycielskian graphs ⋮ Hyperbolicity on graph operators

This page was built for publication: Core congestion is inherent in hyperbolic networks