Sub-cubic cost algorithms for the all pairs shortest path problem

DOI10.1007/3-540-60618-1_86MaRDI QIDQ6122235

Tadao Takaoka

Publication date: 28 February 2024

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

Full work available at URL: http://hdl.handle.net/10092/11154

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Shortest-path problem is not harder than matrix multiplication
• A new upper bound on the complexity of the all pairs shortest path problem
• Fast multiplication of large numbers
• Parallel Matrix and Graph Algorithms

This page was built for publication: Sub-cubic cost algorithms for the all pairs shortest path problem