Free Access
| Issue |
R.A.I.R.O. Recherche opérationnelle
Volume 9, Number V3, 1975
|
|
|---|---|---|
| Page(s) | 13 - 20 | |
| DOI | https://doi.org/10.1051/ro/197509V300131 | |
| Published online | 06 February 2017 | |
- BERGE, Graphes et hypergraphes, Dunod. [Zbl: 0213.25702] [Google Scholar]
- EDMONDS, Paths, trees, flowers, Canad. J. Math., 17. [MR: 177907] [Zbl: 0132.20903] [Google Scholar]
- JOHNSON, Programming in network on graphs, ORC 65-1, University of Berkeley, California. [Google Scholar]
- BURLET, Thèse de 3e cycle, Université de Grenoble (à paraître). [Google Scholar]
- WITZGALL et ZAHN, Modifications of edmonds maximal matching algorithm, J. Res. Nat. Bureau Stand., 69 B, No. 1 et 2. [Zbl: 0141.21901] [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.