All shortest distances in a graph. An improvement to Dantzig's inductive algorithm

DOI10.1016/0012-365X(73)90118-0zbMath0257.05128MaRDI QIDQ2559493

Yves Tabourier

Publication date: 1973

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Other combinatorial set theory (03E05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

Two fast algorithms for all-pairs shortest paths ⋮ A fast algorithm for Steiner trees ⋮ An algorithm to evaluate public transportation stops for minimizing passenger walking distance ⋮ On finding shortest paths in nonnegative networks

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: All shortest distances in a graph. An improvement to Dantzig's inductive algorithm