Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDMA_2012_5_a50, author = {L. I. Sennikova and A. A. Kochkarov}, title = {A parallel algorithm for searching the minimum weight spanning tree on prefractal graph}, journal = {Prikladnaya Diskretnaya Matematika. Supplement}, pages = {95--97}, publisher = {mathdoc}, number = {5}, year = {2012}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a50/} }
TY - JOUR AU - L. I. Sennikova AU - A. A. Kochkarov TI - A parallel algorithm for searching the minimum weight spanning tree on prefractal graph JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2012 SP - 95 EP - 97 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a50/ LA - ru ID - PDMA_2012_5_a50 ER -
%0 Journal Article %A L. I. Sennikova %A A. A. Kochkarov %T A parallel algorithm for searching the minimum weight spanning tree on prefractal graph %J Prikladnaya Diskretnaya Matematika. Supplement %D 2012 %P 95-97 %N 5 %I mathdoc %U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a50/ %G ru %F PDMA_2012_5_a50
L. I. Sennikova; A. A. Kochkarov. A parallel algorithm for searching the minimum weight spanning tree on prefractal graph. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 95-97. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a50/
[1] Emelichev V. A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I., Lektsii po teorii grafov, Nauka, M., 1990 | MR | Zbl
[2] Kochkarov A. A., Kochkarov R. A., “Parallelnyi algoritm poiska kratchaishego puti na predfraktalnom grafe”, Zhurnal vychisl. matem. i matem. fiziki, 44:6 (2004), 1157–1152 | MR | Zbl
[3] Kochkarov A. A., Sennikova L. I., “Kolichestvennye otsenki nekotorykh svyaznostnykh kharakteristik predfraktalnykh grafov”, Prikladnaya diskretnaya matematika, 2011, no. 4(14), 56–61