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} }
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
Tables and Topics from this paper
Tables
373 Citations
New Algorithm and Data Structures for the All Pairs Shortest Path Problem
- Mathematics
- 2013
- Highly Influenced
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs
- Mathematics, Computer Science
- CATS
- 2012
- 4
- Highly Influenced
- PDF
A Forward-Backward Single-Source Shortest Paths Algorithm
- 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
- Mathematics, Computer Science
- Appl. Math. Comput.
- 2007
- 76
Computing and Listing st-Paths in Public Transportation Networks
- Mathematics, Computer Science
- Theory of Computing Systems
- 2016
- 3
References
hierat ion of permlltations 111 Icsirographic order. Comm. ACM 1 1 (I?
- Novcrl
- 1969