A new method is given for finding all shortest distances in a directed network. The amount of work (in performing additions, subtractions, and comparisons) is slightly more than half of that required in the best of previous methods.
No takes yet. Share an insight, caveat, or question.
Hoffman et al. (1972) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context:
More from IBM Journal of Research and Development