Free Access
Volume 2, Number 7, 1968
Page(s) 71 - 85
Published online 01 February 2017
  1. BELLMAN R., On a Routing Problem, Quat. Appl. Math., 16 (1958), pp. 87-90. [MR: 102435] [Zbl: 0081.14403] [Google Scholar]
  2. BERGE C. et GHOUILA-HOURI A., Programmes, jeux et réseaux de transports, Dunod, Paris, 1962. [MR: 192912] [Zbl: 0111.17302] [Google Scholar]
  3. DRAGOMIRESCU M., L'algorithme de min-addition et les chemins critiques dans un graphe, Rev.Roum. Math. Pures et Appl., t. XII,n° 8 (1967), pp. 1045-1051. [MR: 238730] [Zbl: 0162.55701] [Google Scholar]
  4. HU T. C., Revised Matrix Algorithms for Shortest Paths, Siam J. on App. Math., 15 (1967), pp. 207-218. [MR: 214405] [Zbl: 0158.15404] [Google Scholar]
  5. WARSHALL S., A Theorem of Boolean Matrices, J. A. C. M., 9 (1962), pp. 11-13. [MR: 149688] [Zbl: 0118.33104] [Google Scholar]
  6. YOELI M., Note ona Generaîization of Boolean Matrix Theory, American Math., Monthly, 68 (1961), pp. 552-557. [MR: 126472] [Zbl: 0115.02103] [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.

Recommended for you