A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem

DOI10.1137/0206050MaRDI QIDQ4143184zbMATH OpenOpenAlexWikidataFDO

Authors John S. Carson, Averill M. Law

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0206050

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited in

(3)

• Discrete extremal problems
• On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
• Finding real-valued single-source shortest paths in o(n^3) expected time

This page was built for publication: A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem

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