Algorithme de Ford-Fulkerson (French Wikipedia)
Analysis of information sources in references of the Wikipedia article "Algorithme de Ford-Fulkerson" in French language version.
Last modified:
Ref.Un. Ref.Website
Global rank
French rank
209th place
366th place
cambridge.org (Global: 209th place; French: 366th place)
- (en) L. R. Ford et D. R. Fulkerson, « Maximal Flow Through a Network », Canadian Journal of Mathematics, vol. 8, 1956/ed, p. 399–404 (ISSN 0008-414X et 1496-4279, DOI 10.4153/CJM-1956-045-5, lire en ligne, consulté le )
doi.org (Global: 2nd place; French: 3rd place)
dx.doi.org
- (en) L. R. Ford et D. R. Fulkerson, « Maximal Flow Through a Network », Canadian Journal of Mathematics, vol. 8, 1956/ed, p. 399–404 (ISSN 0008-414X et 1496-4279, DOI 10.4153/CJM-1956-045-5, lire en ligne, consulté le )
- Uri Zwick, « The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate », Theoretical Computer Science, vol. 148, no 1, , p. 165–170 (DOI 10.1016/0304-3975(95)00022-O
)
issn.org (Global: 33rd place; French: 4th place)
portal.issn.org
- (en) L. R. Ford et D. R. Fulkerson, « Maximal Flow Through a Network », Canadian Journal of Mathematics, vol. 8, 1956/ed, p. 399–404 (ISSN 0008-414X et 1496-4279, DOI 10.4153/CJM-1956-045-5, lire en ligne, consulté le )