An O(m log D) algorithm for shortest paths

DOI10.1016/0166-218X(80)90004-9MaRDI QIDQ1145158zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A Shortest Path Algorithm for Edge-Sparse Graphs
• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Cited in

(1)

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

Describes a project that uses

Uses Software

• Algorithm 360

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145158)