Geodesic
Hierarchical algorithm for constructing a minimal spanning tree
Matematičeskoe obrazovanie, no. 1 (2020), pp. 51-53 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Based on the concept of “mutually adjacent neighbors”, an algorithm for constructing a minimal spanning tree is developed.
Keywords: minimal spanning tree, hierarchical algorithm, nearest neighbors. 
@article{MO_2020_1_a6,
     author = {S. V. Zakurdaev},
     title = {Hierarchical algorithm for constructing a minimal spanning tree},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {51--53},
     year = {2020},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2020_1_a6/}
}
TY  - JOUR
AU  - S. V. Zakurdaev
TI  - Hierarchical algorithm for constructing a minimal spanning tree
JO  - Matematičeskoe obrazovanie
PY  - 2020
SP  - 51
EP  - 53
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MO_2020_1_a6/
LA  - ru
ID  - MO_2020_1_a6
ER  - 
%0 Journal Article
%A S. V. Zakurdaev
%T Hierarchical algorithm for constructing a minimal spanning tree
%J Matematičeskoe obrazovanie
%D 2020
%P 51-53
%N 1
%U http://geodesic.mathdoc.fr/item/MO_2020_1_a6/
%G ru
%F MO_2020_1_a6
S. V. Zakurdaev. Hierarchical algorithm for constructing a minimal spanning tree. Matematičeskoe obrazovanie, no. 1 (2020), pp. 51-53. http://geodesic.mathdoc.fr/item/MO_2020_1_a6/