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

@article{Dial1969Algorithm3S,
  title={Algorithm 360: shortest-path forest with topological ordering [H]},
  author={Robert B. Dial},
  journal={Commun. ACM},
  year={1969},
  volume={12},
  pages={632-633}
}
  • R. Dial
  • Published 1 November 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…

Tables from this paper

A Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
TLDR
The PCD algorithm (Precomputed Cluster Distances) is introduced, which allows a flexible trade-off between preprocessing time and space on the one hand and query time on the other, allowing significant speedups even for a sublinear amount of extra space.
Short length versions of Menger's theorem
TLDR
It is proved that B-distance forms a metric and NPhardness results on computing B-distances in two cases are given and the third remaining case is open but the evidence to its difficulty is given.
New Algorithm and Data Structures for the All Pairs Shortest Path Problem
TLDR
This study introduces a new deterministic algorithm for the APSP that provides an alternative to the existing MT algorithm and is shown to be efficient as the expected running time is the same O(n log n).
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs
TLDR
The all pairs shortest path (APSP) problem can be solved in O(mn +n 2 log(c=n) time with the data structure of cascading bucket system with the idea for speed-up.
A Forward-Backward Single-Source Shortest Paths Algorithm
  • D. Wilson, U. Zwick
  • Computer Science
    2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
TLDR
A new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms, which assumes that edges in the out-going and incoming adjacency lists of the vertices appear in nondecreasing order of weight.
Guided Search for the Shortest Path on Transportation Networks
TLDR
A new approach is presented which guides the search of the shortest path algorithms under investigation and shows that the guided algorithm outperforms the original algorithms for transportation networks with Euclidean arc costs.
Shortest Paths in Geometric Intersection Graphs
TLDR
This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks, and presents the first near-linear-time p1 ` εq-approximation algorithm for the diameter and for other related problems, such as the radius and the bichromatic closest pair.
An Auction Algorithm for Shortest Pathsi
TLDR
Based on experiments with randomly generated problems on a serial machine, the algorithm outperforms substantially its closest competitors for problems with few origins and a single destination and seems better suited for parallel computation than other shortest path algorithms.
New Polynomial Shortest Path Algorithms and Their Computational Attributes
TLDR
Six new variants of the polynomially bounded Partitioning Shortest Path algorithm for finding the shortest path from one node to all other nodes in a network augment the PSP algorithm to maintain a property called sharp by Shier and Witzgall.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
The Interaction Algorithm and Practical Fourier Analysis: An Addendum
SUMMARY In the original paper it was misleadingly stated that the Yates algorithm is effectively self-inverse. This statement is here elucidated, and a numerical example is given. Attention is drawn
SWAC Experiments on the Use of Orthogonal Polynomials for Data Fitting
TLDR
In [3] one of us discussed the problem of finding f~ ) (x ) oh a digital computer and outlined certain advantages of determining f~ (x) in terms of polynomials pk(x) orthogonal over ~.
hierat ion of permlltations 111 Icsirographic order. Comm. ACM 1 1 (I?
  • Novcrl
  • 1969
Remark on algorithm 272: Procedure for the normal distribution functions
TLDR
This algorithm is one of a class of normal deviate generators, which the authors shall call "chi-squared projections" by using van Neumann rejection to generate sin (¢) and cos (¢), without generating ¢ explicitly [3], which significantly enhances speed by eliminating the calls to the sin and cos functions.
Algorithm 291: logarithm of gamma function
TLDR
This procedure evaluates the natural logarithm of gamma(x) for all x > 0, accurate to 10 decimal places and has the following syntactical errors.
Algorithm 29: polynomial transformer
c o m m e n t L S F I T aceepts m values of t h e f u n c t i o n f at equal intervals of the abscissa f r o m xl t h r o u g h xm, a n d obt'~.ins in p{0] t h r o u g h p[ki the eoeffieients of the
Remark on Algorithm 178
  • Comm . ACM
...
...