Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry

DOI10.1145/3516483OpenAlexW2802893379WikidataQ115522515 ScholiaQ115522515MaRDI QIDQ6058245

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Marianne Thieffry, Cedric Freiberger, Felix Montenegro-Retana

Publication date: 31 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphshyperbolic geometryscale-free networksbidirectional shortest path

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (3)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry ⋮ Deterministic performance guarantees for bidirectional BFS on real-world networks

This page was built for publication: Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry