Sur le problème du couplage maximal
RAIRO - Operations Research - Recherche Opérationnelle (1975)
- Volume: 9, Issue: V3, page 13-20
- ISSN: 0399-0559
Access Full Article
topHow to cite
topUhry, J. P.. "Sur le problème du couplage maximal." RAIRO - Operations Research - Recherche Opérationnelle 9.V3 (1975): 13-20. <http://eudml.org/doc/104621>.
@article{Uhry1975,
author = {Uhry, J. P.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {fre},
number = {V3},
pages = {13-20},
publisher = {EDP-Sciences},
title = {Sur le problème du couplage maximal},
url = {http://eudml.org/doc/104621},
volume = {9},
year = {1975},
}
TY - JOUR
AU - Uhry, J. P.
TI - Sur le problème du couplage maximal
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1975
PB - EDP-Sciences
VL - 9
IS - V3
SP - 13
EP - 20
LA - fre
UR - http://eudml.org/doc/104621
ER -
References
top- [1] BERGE, Graphes et hypergraphes, Dunod. Zbl0213.25702
- [2] EDMONDS, Paths, trees, flowers, Canad. J. Math., 17. Zbl0132.20903MR177907
- [3] JOHNSON, Programming in network on graphs, ORC 65-1, University of Berkeley, California.
- [4] BURLET, Thèse de 3e cycle, Université de Grenoble (à paraître).
- [5] WITZGALL et ZAHN, Modifications of edmonds maximal matching algorithm, J. Res. Nat. Bureau Stand., 69 B, No. 1 et 2. Zbl0141.21901
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.