Free Access
Issue
R.A.I.R.O. Recherche opérationnelle
Volume 9, Number V3, 1975
Page(s) 5 - 12
DOI https://doi.org/10.1051/ro/197509V300051
Published online 06 February 2017
  • N. CHRISTOFIDES, The shortest Hamiltonian chain of a graphe, S.I.A.M. J. Appl. Math., 19, 1970, p. 689-696. [MR: 274332] [Zbl: 0214.23403]
  • A. KAUFMANN, Introduction à la combinatorique en vue des applications, Dunod, Paris, 1968. [MR: 373909] [Zbl: 0169.01801]
  • T. B. BOFFEY, A note on minimal length Hamilton path and circuit algorithms, Oper. Res. Quart., 24, n° 3, 1973, p. 437-439. [MR: 334911] [Zbl: 0269.90050]
  • B. ROY, Transitivité et connexité, C.R. Acad. Sc., Paris, série A, 249, 1959, p. 216-218. [MR: 109792] [Zbl: 0092.15902]
  • I. TOMESCU, Sur l'algorithme matriciel de B. Roy, R.A.I.R.O., 2, n° 7, 1968, p. 87-91. [EuDML: 193100] [MR: 232718] [Zbl: 0179.29302]

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.