Bidirectional Dijkstra's algorithm is instance-optimal

DOI10.1137/1.9781611978315.16MaRDI QIDQ7292107zbMATH OpenFDO

Authors Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tětek

Publication date 8 July 2026

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

Mathematics Subject Classification ID

No records found.

Cited in

(4)

• External-memory priority queues with optimal insertions
• Instance-optimal imprecise convex hull
• Simpler universally optimal Dijkstra
• On the instance optimality of detecting collisions and subgraphs

This page was built for publication: Bidirectional Dijkstra's algorithm is instance-optimal

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