Geodesic
An algorithm for determining the minimal spanning tree of an increasing graph
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 17 (1977) no. 6, pp. 1607-1610 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1977_17_6_a31,
     author = {G. B. Roshchin},
     title = {An algorithm for determining the minimal spanning tree of an increasing graph},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1607--1610},
     year = {1977},
     volume = {17},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1977_17_6_a31/}
}
TY  - JOUR
AU  - G. B. Roshchin
TI  - An algorithm for determining the minimal spanning tree of an increasing graph
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1977
SP  - 1607
EP  - 1610
VL  - 17
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1977_17_6_a31/
LA  - ru
ID  - ZVMMF_1977_17_6_a31
ER  - 
%0 Journal Article
%A G. B. Roshchin
%T An algorithm for determining the minimal spanning tree of an increasing graph
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1977
%P 1607-1610
%V 17
%N 6
%U http://geodesic.mathdoc.fr/item/ZVMMF_1977_17_6_a31/
%G ru
%F ZVMMF_1977_17_6_a31
G. B. Roshchin. An algorithm for determining the minimal spanning tree of an increasing graph. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 17 (1977) no. 6, pp. 1607-1610. http://geodesic.mathdoc.fr/item/ZVMMF_1977_17_6_a31/