Tag
A Chinese professor has discovered a new deterministic shortest path algorithm that beats the 40-year-old sorting barrier by combining Dijkstra and Bellman-Ford with frontier reduction, achieving O(m log^(2/3) n) time on sparse graphs.
Introduces a tool that provides live visualizations and code for learning algorithms like Prim's, Dijkstra, and sorting, making concepts easier to understand.
An inventory of Edsger Dijkstra's personal library and papers, now archived in Leuven, Belgium, cataloging his college notes, books, and manuscripts.
Five researchers from Tsinghua, Stanford, and Max Planck have developed a new shortest path algorithm that beats Dijkstra's for sparse directed graphs, achieving O(m log^(2/3) n) time complexity, the first improvement since 1987.