A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

@article{Dial1979ACA,
  title={A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees},
  author={R. Dial and Fred Glover and David Karney and Darwin Klingman},
  journal={Networks},
  year={1979},
  volume={9},
  pages={215-248}
}
This paper examines d i f ferent aZgorithms for caZculating the shortest path f r o m one node t o aZZ other nodes i n a network. More specificaZZy, we seek to advance the state-of-the-art of computer imp Zementation techno Zogy f o r such a Zgorithms and the probZems they soZve by examining the e f f e c t of innovative comput e r science l i s t structures and ZabeZing techniques on algorithmic performance. a powerful influence on solution e f f ic iency , zjith the ident i ty of the best… CONTINUE READING
Highly Cited
This paper has 124 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 70 extracted citations

125 Citations

0510'84'91'99'07'15
Citations per Year
Semantic Scholar estimates that this publication has 125 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…