An O(m log D) algorithm for shortest paths

DOI10.1016/0166-218X(80)90004-9zbMath0445.05060MaRDI QIDQ1145158

Pierre Hansen

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

binary counting treeDijkstra's shortest paths algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

An O(m log log D) algorithm for shortest paths

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: An O(m log D) algorithm for shortest paths