• DOI:10.1145/363269.363610
Corpus ID: 6754003

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

@article{Dial1969Algorithm3S,
  title={Algorithm 360: shortest-path forest with topological ordering [H]},
  author={R. Dial},
  journal={Commun. ACM},
  year={1969},
  volume={12},
  pages={632-633}
}

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

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed