On the exponent of all pairs shortest path problem
type: Item
instance of: scholarly article
title: On the exponent of all pairs shortest path problem
zbMATH Open document ID: 0877.68090
author: Zvi Galil
author: Noga Alon
author: Olded Margalit
published in: Journal of Computer and System Sciences
publication date: 1997-12-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1022054
zbMATH Keywords: shortest path problem
zbMATH Keywords: directed graphs
MaRDI profile type: Publication
full work available at URL: jcss.1997.1388
OpenAlex ID: W2618199688
cites work: Q4091421
cites work: Faster algorithms for the shortest path problem
cites work: Q4230366
cites work: Matrix multiplication via arithmetic progressions
cites work: A note on two problems in connexion with graphs
cites work: New Bounds on the Complexity of the Shortest Path Problem
cites work: Scaling algorithms for network problems
cites work: Gaussian elimination is not optimal
cites work: An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
DOI: 10.1006/JCSS.1997.1388
description: scientific article; zbMATH DE number 1022054