Geodesic
Optimale Matching Forests
Séminaire lotharingien de combinatoire, Tome 15 (1986)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

We treat a generalization of the branching- and matching-problems: the matching forest problem. This means to consider a mixed graph and search, under certain target goals, a subset of the edges of the graph such that these edges do not contain a cycle and such that each vertex is on at most one edge. 

@article{SLC_1986_15_a15,
     author = {Ursula R\"utsch},
     title = {Optimale {Matching} {Forests}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {15},
     year = {1986},
     url = {http://geodesic.mathdoc.fr/item/SLC_1986_15_a15/}
}
TY  - JOUR
AU  - Ursula Rütsch
TI  - Optimale Matching Forests
JO  - Séminaire lotharingien de combinatoire
PY  - 1986
VL  - 15
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1986_15_a15/
ID  - SLC_1986_15_a15
ER  - 
%0 Journal Article
%A Ursula Rütsch
%T Optimale Matching Forests
%J Séminaire lotharingien de combinatoire
%D 1986
%V 15
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1986_15_a15/
%F SLC_1986_15_a15
Ursula Rütsch. Optimale Matching Forests. Séminaire lotharingien de combinatoire, Tome 15 (1986). http://geodesic.mathdoc.fr/item/SLC_1986_15_a15/