An efficient parallel algorithm for the all pairs shortest path problem

DOI10.1007/3-540-50728-0_51MaRDI QIDQ6199470

Tadao Takaoka

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the Shortest Route Through a Network
• A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
• An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
• A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$

This page was built for publication: An efficient parallel algorithm for the all pairs shortest path problem