共 50 条
- [45] Vectorized algorithms for detecting the shortest paths in weighted directed graphs and their realization in vector supercomputers Programmirovanie, 1992, (01): : 65 - 71
- [46] Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs Discrete & Computational Geometry, 2020, 64 : 1141 - 1166
- [47] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
- [49] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 153 - 166