共 50 条
- [1] Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs 50TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2021,
- [2] The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs SOFTWARE-PRACTICE & EXPERIENCE, 2023, 53 (06): : 1287 - 1303
- [3] Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph PROCEEDINGS OF THE 37TH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ACM ICS 2023, 2023, : 277 - 288
- [5] All-Pairs Shortest Paths in Geometric Intersection Graphs ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 253 - 264
- [6] External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 146 - 157
- [7] A blocked all-pairs shortest-paths algorithm ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 419 - 432
- [8] More Algorithms for All-Pairs Shortest Paths in Weighted Graphs STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 590 - 598
- [9] Dynamic approximate all-pairs shortest paths in undirected graphs 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 499 - 508