Uniform Guarded Bootstrapping for Topology-Sensitive Directed Shortest PathsResearch Paper
Single-source shortest paths on a directed graph with nonnegative real weights asks for the distance from a source to every vertex. In the comparison–addition model, where real weights may only be added and compared, Dijkstra's algorithm with a Fibonacci heap takes time, and for a long time this was the best general bound. Recent work went…