Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference13 articles.
1. Fast estimation of diameter and shortest paths (without matrix multiplication);Aingworth;SIAM J. Comput.,1999
2. On the exponent of the all pairs shortest path problem;Alon;J. Comput. System Sci.,1997
3. More algorithms for all-pairs shortest paths in weighted graphs;Chan,2007
4. Matrix multiplication via arithmetic progressions;Coppersmith;J. Symbolic Comput.,1990
5. All pairs almost shortest paths;Dor;SIAM J. Comput.,2000
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs;Mathematics;2023-11-28
2. A New Proposed Modified Shortest Path Algorithm’s Using Dijkstra’s;2023 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI);2023-05-25
3. Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
5. Accelerating parallel graph computing with speculation;Proceedings of the 16th ACM International Conference on Computing Frontiers;2019-04-30