Geodesic
Finding Minimal Branchings With a Given Number of Arcs
Yugoslav journal of operations research, Tome 12 (2002) no. 1, p. 1 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

We describe an algorithm for finding a minimal s -branching (where s is a given number of its arcs) in a weighted digraph with an asymetric weight matrix. The algorithm uses the basic principles of the method (previously developed by J. Edmonds) for determining a minimal branching in the case when the number of its arcs is not specified in advance. Here we give a proof of the correctness for the described algorithm.
Classification : 05C85 05C05 05C20 90B99 90C99
Keywords: Combinatorial optimization, weighted graphs, minimal branching. 
@article{YJOR_2002_12_1_a0,
     author = {Drago\v{s} Cvetkovi\'c and Mirjana \v{C}angalovi\'c},
     title = {Finding {Minimal} {Branchings} {With} a {Given} {Number} of {Arcs}},
     journal = {Yugoslav journal of operations research},
     pages = {1 },
     year = {2002},
     volume = {12},
     number = {1},
     zbl = {1150.05401},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2002_12_1_a0/}
}
TY  - JOUR
AU  - Dragoš Cvetković
AU  - Mirjana Čangalović
TI  - Finding Minimal Branchings With a Given Number of Arcs
JO  - Yugoslav journal of operations research
PY  - 2002
SP  - 1 
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2002_12_1_a0/
LA  - en
ID  - YJOR_2002_12_1_a0
ER  - 
%0 Journal Article
%A Dragoš Cvetković
%A Mirjana Čangalović
%T Finding Minimal Branchings With a Given Number of Arcs
%J Yugoslav journal of operations research
%D 2002
%P 1 
%V 12
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2002_12_1_a0/
%G en
%F YJOR_2002_12_1_a0
Dragoš Cvetković; Mirjana Čangalović. Finding Minimal Branchings With a Given Number of Arcs. Yugoslav journal of operations research, Tome 12 (2002) no. 1, p. 1 . http://geodesic.mathdoc.fr/item/YJOR_2002_12_1_a0/