Finding all shortest distances in a directed network

  • Authors:

  • A. J. Hoffman;S. Winograd

  • Affiliations:

  • IBM Thomas J. Watson Research Center, Yorktown Heights, New York;IBM Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1972

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.