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  -