A new algorithm to find the shortest paths between all pairs of nodes
type: Item
instance of: scholarly article
title: A new algorithm to find the shortest paths between all pairs of nodes
zbMATH Open document ID: 0471.68043
DOI: 10.1016/0166-218X(82)90031-2
author: Giorgio Gallo
author: Stefano Pallottino
published in: Discrete Applied Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3738930
zbMATH Keywords: worst case time complexity
zbMATH Keywords: space complexity
describes a project that uses: Algorithm 97
describes a project that uses: Algorithm 360
MaRDI profile type: Publication
cites work: A Dual Shortest Path Algorithm
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
cites work: A note on two problems in connexion with graphs
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Reoptimization procedures in shortest path problem
cites work: Technical Note—Shortest-Path Algorithms: A Comparison
cites work: Q4130999
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Deterministic network optimization: A bibliography
cites work: A generalized permanent label setting algorithm for the shortest path between specified nodes
cites work: Q4118953
cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem
cites work: Q4144192
cites work: A Theorem on Boolean Matrices
cites work: Minimum cost routing for static network models
cites work: On a routing problem
cites work: Q3844775
description: scientific article; zbMATH DE number 3738930