Hyperbolic Embeddings for Near-Optimal Greedy Routing

DOI10.1145/3381751zbMath1521.68089OpenAlexW3014393657WikidataQ115522532 ScholiaQ115522532MaRDI QIDQ6039932

Anton Krohmer, Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann

Publication date: 23 May 2023

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3381751

zbMATH Keywords

robustnesshyperbolic spacegeographic routinggreedy routingspanning treesstretch

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Elementary problems in hyperbolic and elliptic geometries (51M09)

Cites Work

• Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
• MPFR
• Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
• Navigation in Real-World Complex Networks through Embedding in Latent Spaces
• Succinct Greedy Geometric Routing Using Hyperbolic Geometry
• Unnamed Item
• Unnamed Item

This page was built for publication: Hyperbolic Embeddings for Near-Optimal Greedy Routing