Free Access
Volume 3, Number 16, 1969
Page(s) 65 - 73
Published online 01 February 2017
  1. C. BERGE, La théorie des graphes et ses applications, Dunod, 1958. [MR: 102822] [Zbl: 0088.15404] [Google Scholar]
  2. D. F. MARTIN, On algorithms for the generation of the limiting form of boolean precedence matrices. Comm. privée. [Google Scholar]
  3. C. V. RAMAMOORTHY, « Analysis of graphs by connectivity considerations» J.A.CM. 13, 211-223, avril 1966. [MR: 202632] [Zbl: 0141.21503] [Google Scholar]
  4. B. ROY, « Cheminement et connexité dans les graphes. Application aux problèmes d'ordonnancement», Metra, série spéciale # 1, 1962. [Google Scholar]
  5. J. M. S. SIMOES PEREIRA, « On the boolean matrix equation M' = Vd i=1 Mi», J.A.C.M. 12, 376-382, juillet 1965. [MR: 205761] [Zbl: 0144.24804] [Google Scholar]
  6. S. WARSHALL, « A theorem on boolean matrices», J.A. CM. 9, 11-12 janvier 1962. [MR: 149688] [Zbl: 0118.33104] [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