共 50 条
- [24] Efficient parallel algorithms for computing all pair shortest paths in directed graphs Algorithmica, 1997, 17 : 399 - 415
- [26] Efficient parallel algorithms for computing all pair shortest paths in directed graphs Algorithmica (New York), 4 (399):
- [27] Logspace algorithms for computing shortest and longest paths in series-parallel graphs FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 216 - 227
- [28] Parametric Shortest Paths in Planar Graphs 2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 876 - 895