A faster distributed single-source shortest paths algorithm

DOI10.1109/FOCS.2018.00071MaRDI QIDQ6944341zbMATH OpenFDO

Authors Danupon Nanongkai, Sebastian Forster

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2018.00071

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• Distributed distance approximation
• Are there graphs whose shortest path structure requires large edge weights?
• A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP
• Computing minimum weight cycle in the CONGEST model
• Distance computations in the hybrid network model via oracle simulations

This page was built for publication: A faster distributed single-source shortest paths algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944341)