BMSSP Dijkstra's 1984 "sorting barrier" * ArXiv - 0 views
-
John Lam about 3 hours agoTsinghua University scientists have developed the best shortest-path algorithm in 41 years, and broke Dijkstra's 1984 "sorting barrier". BMSSP runs in O(m \log^{2/3} n).