A Faster Shortest Path Algorithm

Automated excerpt

This algorithm, called C-HD, is presented in this Lean proof. Run bounded local searches along outgoing edges. The runtime bound for Dijkstra is O(nlog⁡n)O(n \log n); the C-HD algorithm gets O(nlog⁡11/12n)O(n \log^{11/12} n).

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.