共 50 条
- [2] Parallelization of All-Pairs-Shortest-Path Algorithms in Unweighted Graph [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING IN ASIA-PACIFIC REGION (HPC ASIA 2020), 2020, : 63 - 72
- [3] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 514 - 523
- [5] Interval-based performance modeling for the all-pairs-shortest-path problem on GPUs [J]. The Journal of Supercomputing, 2015, 71 : 4192 - 4214
- [6] Interval-based performance modeling for the all-pairs-shortest-path problem on GPUs [J]. JOURNAL OF SUPERCOMPUTING, 2015, 71 (11): : 4192 - 4214
- [8] Optimal shortest path set problem in undirected graphs [J]. Journal of Combinatorial Optimization, 2015, 29 : 511 - 530
- [9] Dynamic approximate all-pairs shortest paths in undirected graphs [J]. 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 499 - 508