All pairs shortest paths for graphs with small integer length edges
type: Item
instance of: scholarly article
title: All pairs shortest paths for graphs with small integer length edges
zbMATH Open document ID: 0877.68089
author: Zvi Galil
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: 1022053
zbMATH Keywords: all pairs shortest distances
zbMATH Keywords: all pairs shortest paths
MaRDI profile type: Publication
full work available at URL: jcss.1997.1385
OpenAlex ID: W1970052762
cites work: On the exponent of all pairs shortest path problem
cites work: All pairs shortest distances for graphs with small integer length edges
cites work: Q4230366
cites work: Matrix multiplication via arithmetic progressions
DOI: 10.1006/JCSS.1997.1385
Recommended article: All pairs shortest distances for graphs with small integer length edges
Recommended article: All-Pairs Almost Shortest Paths
Recommended article: All-pairs shortest paths and the essential subgraph
Recommended article: All-pairs small-stretch paths
Recommended article: All-pairs shortest paths in geometric intersection graphs
Recommended article: A survey of the all-pairs shortest paths problem and its variants in graphs
Recommended article: An all-pairs shortest path algorithm for bipartite graphs
Recommended article: On the set of all shortest paths of a given length in a connected graph
Recommended article: Q4886059
description: scientific article; zbMATH DE number 1022053