Efficient construction of directed hopsets and parallel approximate shortest paths

DOI10.1145/3357713.3384270OpenAlexW3034281291MaRDI QIDQ5144921

Jeremy T. Fineman, Katina Russell, Nairen Cao

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

shortcutsparallel algorithmshortest pathshopsets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts

This page was built for publication: Efficient construction of directed hopsets and parallel approximate shortest paths