Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks

DOI10.1080/15427951.2010.554320zbMath1245.68033OpenAlexW2009182597MaRDI QIDQ2909112

Mingji Lou, Jonckheere Edmond, Francis Bonahon, Yuliy M. Baryshnikov

Publication date: 29 August 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1318514562

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (14)

Information transfer fidelity in spin networks and ring-based quantum routers ⋮ Obstructions to a small hyperbolicity in Helly graphs ⋮ Data center interconnection networks are not hyperbolic ⋮ Differential geometric treewidth estimation in adiabatic quantum computation ⋮ Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) ⋮ On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions ⋮ Navigating the negative curvature of Google Maps ⋮ Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications ⋮ Quantum networks: anti-core of spin chains ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ A review of two network curvature measures ⋮ Traffic Congestion in Expanders and (p,δ)–Hyperbolic Spaces ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Generalized chordality, vertex separators and hyperbolicity on graphs

This page was built for publication: Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks