共 50 条
- [23] 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
- [24] Faster All-Pairs Shortest Paths Via Circuit Complexity STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 664 - 673
- [25] Dynamic approximate all-pairs shortest paths in undirected graphs 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 499 - 508
- [27] Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
- [29] Computing All-Pairs Shortest Paths by Leveraging Low Treewidth JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2012, 43 : 353 - 388
- [30] All-pairs shortest paths algorithm for highdimensional sparse graphs PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 19 (01): : 84 - 92