Applying skeletons to speed up the Arc-Flags routing algorithm

DOI10.1137/1.9781611977561.CH10MaRDI QIDQ6543551zbMATH OpenFDO

Authors Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Isaac, Simon Krogmann, Pascal Lenzner

Publication date 24 May 2024

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 5734722
• Partitioning graphs to speedup Dijkstra's algorithm
• Fully dynamic update of arc-flags
• Speed-Up Techniques for Shortest-Path Computations
• Arc-flags in dynamic graphs

This page was built for publication: Applying skeletons to speed up the Arc-Flags routing algorithm

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