Algorithm 360: shortest-path forest with topological ordering [H]

  title={Algorithm 360: shortest-path forest with topological ordering [H]},
  author={R. Dial},
  journal={Commun. ACM},
  • R. Dial
  • Published 1969
  • Computer Science
  • Commun. ACM
  • row one of IL down the right edge of a strip of paper using the same spacing as for the observations. [...] Key Method Now write row two of MD on a strip of paper and proceed as before. If we continue this process with all the rows of Mn we will get a new vector zn whose elements are linear transformations of the observation vector y, The dimension of z,, is the same as that of y. Similarly form znBl from Zn and &-I . Continuing this process we finally obtain z1 = z which is the desired interaction vector. In…Expand Abstract
    373 Citations
    Short length versions of Menger's theorem
    • 24
    New Algorithm and Data Structures for the All Pairs Shortest Path Problem
    • Highly Influenced
    Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs
    • 4
    • Highly Influenced
    • PDF
    A Forward-Backward Single-Source Shortest Paths Algorithm
    • D. Wilson, U. Zwick
    • Mathematics, Computer Science
    • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
    • 2013
    • 3
    • PDF
    An improved Dijkstra's shortest path algorithm for sparse network
    • 76
    Computing and Listing st-Paths in Public Transportation Networks
    • 3


    hierat ion of permlltations 111 Icsirographic order. Comm. ACM 1 1 (I?
    • Novcrl
    • 1969