Geodesic
On the problem of finding a minimal Euler multigraph for a connected graph with weighted edges
Diskretnyj analiz i issledovanie operacij, no. 12 (1974), pp. 61-67.

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

@article{DA_1974_12_a8,
     author = {A. I. Serdyukov},
     title = {On the problem of finding a minimal {Euler} multigraph for a connected graph with weighted edges},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {61--67},
     publisher = {mathdoc},
     number = {12},
     year = {1974},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1974_12_a8/}
}
TY  - JOUR
AU  - A. I. Serdyukov
TI  - On the problem of finding a minimal Euler multigraph for a connected graph with weighted edges
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1974
SP  - 61
EP  - 67
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1974_12_a8/
LA  - ru
ID  - DA_1974_12_a8
ER  - 
%0 Journal Article
%A A. I. Serdyukov
%T On the problem of finding a minimal Euler multigraph for a connected graph with weighted edges
%J Diskretnyj analiz i issledovanie operacij
%D 1974
%P 61-67
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1974_12_a8/
%G ru
%F DA_1974_12_a8
A. I. Serdyukov. On the problem of finding a minimal Euler multigraph for a connected graph with weighted edges. Diskretnyj analiz i issledovanie operacij, no. 12 (1974), pp. 61-67. http://geodesic.mathdoc.fr/item/DA_1974_12_a8/