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

DOI10.1137/0206050zbMath0366.94040OpenAlexW2022344632WikidataQ114978720 ScholiaQ114978720MaRDI QIDQ4143184

Averill M. Law, John S. Carson

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

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

Related Items (3)

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

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