Free Access
Volume 4, Number V3, 1970
Page(s) 11 - 14
Published online 06 February 2017
  • J. EDMONDS and R. M. KARP, A Labelling Method for Maximal Network Flows which is Bounded by a Polynomial in the Number of Nodes, to appear as an IBM or NBS report. Voir aussi [3]. [Google Scholar]
  • L. R. FORD and D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, New-Jersey (1962). [MR: 159700] [Zbl: 1216.05047] [Google Scholar]
  • T. C. HU, Integer Programming and Network Flows, Addison-Wesley Publishing Company, Reading, Massachusetts, Menlo Park California, London, Don Mills, Ontario (1969). [MR: 263420] [Zbl: 0197.45701] [Google Scholar]
  • M. F. A. OPRESCU, «Le calcul du flux optimal dans un réseau par la méthode des compensations successives», Revue Française d'Informatique et de Recherche Opérationnelle, 3e année, n° V-l, pp. 39-59 (1969). [EuDML: 104463] [Zbl: 0183.45005] [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.