Q4694733
type: Item
instance of: scholarly article
zbMATH Open document ID: 0768.68062
author: Tadao Takaoka
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 219247
zbMATH Keywords: distance matrix multiplication
zbMATH Keywords: all pairs shortest path
zbMATH Keywords: directed graph
zbMATH Keywords: shortest distances
zbMATH Keywords: time complexity
zbMATH Keywords: Fredman's algorithm
MaRDI profile type: Publication
Recommended article: A new upper bound on the complexity of the all pairs shortest path problem
Recommended article: Q4425938
Recommended article: Q4737195
Recommended article: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Recommended article: Computing and Combinatorics
Recommended article: All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
Recommended article: STACS 2005
Recommended article: A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time
Recommended article: Faster All-Pairs Shortest Paths via Circuit Complexity
Recommended article: Faster all-pairs shortest paths via circuit complexity
description: scientific article; zbMATH DE number 219247