Incremental SSSP for sparse digraphs beyond the hopset barrier

DOI10.1137/1.9781611977073.137MaRDI QIDQ6575218zbMATH OpenFDO

Authors Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.137

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• On incremental approximate shortest paths in directed graphs
• Incremental approximate single-source shortest paths with predictions

This page was built for publication: Incremental SSSP for sparse digraphs beyond the hopset barrier

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