Tag
The paper introduces GATNextHop, a Graph Attention Network model that approximates shortest path routing and generalizes across network topologies, evaluated against Dijkstra's algorithm on real-world ISP networks.
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.
This paper analyzes distance-preserving embeddings in inhomogeneous random graphs, providing tighter distortion bounds than classical worst-case results and introducing a GNN-augmented variant that learns universal features from small graphs.
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.
Researchers from Tsinghua University have developed a new shortest-path algorithm with O(m log^{2/3} n) complexity, surpassing Dijkstra's algorithm, which had been considered theoretically optimal for 41 years.