Geodesic
Algorithm for the shortest connection of a group of graph vertices
Doklady Akademii Nauk, Tome 200 (1971) no. 4, pp. 773-776.

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

@article{DAN_1971_200_4_a5,
     author = {A. Yu. Levin},
     title = {Algorithm for the shortest connection of a group of graph vertices},
     journal = {Doklady Akademii Nauk},
     pages = {773--776},
     publisher = {mathdoc},
     volume = {200},
     number = {4},
     year = {1971},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1971_200_4_a5/}
}
TY  - JOUR
AU  - A. Yu. Levin
TI  - Algorithm for the shortest connection of a group of graph vertices
JO  - Doklady Akademii Nauk
PY  - 1971
SP  - 773
EP  - 776
VL  - 200
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1971_200_4_a5/
LA  - ru
ID  - DAN_1971_200_4_a5
ER  - 
%0 Journal Article
%A A. Yu. Levin
%T Algorithm for the shortest connection of a group of graph vertices
%J Doklady Akademii Nauk
%D 1971
%P 773-776
%V 200
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1971_200_4_a5/
%G ru
%F DAN_1971_200_4_a5
A. Yu. Levin. Algorithm for the shortest connection of a group of graph vertices. Doklady Akademii Nauk, Tome 200 (1971) no. 4, pp. 773-776. http://geodesic.mathdoc.fr/item/DAN_1971_200_4_a5/