More on kth shortest paths

  • Authors:

  • B. L. Fox

  • Affiliations:

  • Univ. of Montreal, Montreal, Canada

  • Venue:
  • Communications of the ACM
  • Year:
  • 1975

Quantified Score

Hi-index 48.23

Visualization

Abstract

In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).