Affiliation:
1. University of Waterloo, Canada
Abstract
We revisit the all-pairs-shortest-paths problem for an unweighted undirected graph with
n
vertices and
m
edges. We present new algorithms with the following running times:
{
O
(
mn
/log
n
) if
m
>
n
log
n
log log log
n
O
(
mn
log log
n
/log
n
) if
m
>
n
log log
n
O
(
n
2
log
2
log
n
/log
n
) if
m
≤
n
log log
n
.
These represent the best time bounds known for the problem for all
m
≪
n
1.376
. We also obtain a similar type of result for the diameter problem for unweighted directed graphs.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30
2. Shortest distances as enumeration problem;Discrete Applied Mathematics;2024-01
3. Age of Information Diffusion on Social Networks: Optimizing Multi-Stage Seeding Strategies;Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing;2023-10-16
4. Dijkstra’s Single Source Shortest Path Algorithm;Edsger Wybe Dijkstra;2022-07-12
5. Optimizing differentially-maintained recursive queries on dynamic graphs;Proceedings of the VLDB Endowment;2022-07