Geodesic
Complexity of the determination of the maximum weighted joining in a~graph
Diskretnyj analiz i issledovanie operacij, Tome 4 (1997) no. 3, pp. 3-8.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_1997_4_3_a0,
     author = {A. A. Ageev},
     title = {Complexity of the determination of the maximum weighted joining in a~graph},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--8},
     publisher = {mathdoc},
     volume = {4},
     number = {3},
     year = {1997},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1997_4_3_a0/}
}
TY  - JOUR
AU  - A. A. Ageev
TI  - Complexity of the determination of the maximum weighted joining in a~graph
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1997
SP  - 3
EP  - 8
VL  - 4
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1997_4_3_a0/
LA  - ru
ID  - DA_1997_4_3_a0
ER  - 
%0 Journal Article
%A A. A. Ageev
%T Complexity of the determination of the maximum weighted joining in a~graph
%J Diskretnyj analiz i issledovanie operacij
%D 1997
%P 3-8
%V 4
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1997_4_3_a0/
%G ru
%F DA_1997_4_3_a0
A. A. Ageev. Complexity of the determination of the maximum weighted joining in a~graph. Diskretnyj analiz i issledovanie operacij, Tome 4 (1997) no. 3, pp. 3-8. http://geodesic.mathdoc.fr/item/DA_1997_4_3_a0/