An O(m log D) algorithm for shortest paths
type: Item
instance of: scholarly article
title: An O(m log D) algorithm for shortest paths
zbMATH Open document ID: 0445.05060
DOI: 10.1016/0166-218X(80)90004-9
author: Pierre Hansen
published in: Discrete Applied Mathematics
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3695241
zbMATH Keywords: Dijkstra's shortest paths algorithm
zbMATH Keywords: binary counting tree
describes a project that uses: Algorithm 360
MaRDI profile type: Publication
cites work: Q4083324
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: A note on two problems in connexion with graphs
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Q4130999
cites work: A Shortest Path Algorithm for Edge-Sparse Graphs
description: scientific article; zbMATH DE number 3695241