Free Access
| Issue |
R.A.I.R.O. Recherche opérationnelle
Volume 7, Number V1, 1973
|
|
|---|---|---|
| Page(s) | 53 - 61 | |
| DOI | https://doi.org/10.1051/ro/197307V100531 | |
| Published online | 06 February 2017 | |
- FLOYD R. W., Algorithm 97 : Shortest path, CACM 5 (6), 1962, 345. [Google Scholar]
- YEN Jin. Y., Finding the lengths of all shortest paths in N-Node Non-negative-Distance Complete Networks using l /2 N3 additions and N3 Comparisons , J.A.C.M., vol. 19, n° 3, july 1972, pp. 423-424. [Zbl: 0242.94028] [Google Scholar]
- DANTZIG G. G., All shortest routes in a graph, Tech. Rep. n° 66-3, november 1966, Stanford Univ. California. [MR: 221981] [Google Scholar]
- Hu T. C., Integer programming and network flows, pp. 161-168, Addison Wesley 1969. [MR: 263420] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.