Geodesic
A parallel algorithm for searching for the shortest path on a prefractal graph
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 6, pp. 1147-1152

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

@article{ZVMMF_2004_44_6_a16,
     author = {A. A. Kochkarov and R. A. Kochkarov},
     title = {A parallel algorithm for searching for the shortest path on a prefractal graph},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1147--1152},
     publisher = {mathdoc},
     volume = {44},
     number = {6},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_6_a16/}
}
TY  - JOUR
AU  - A. A. Kochkarov
AU  - R. A. Kochkarov
TI  - A parallel algorithm for searching for the shortest path on a prefractal graph
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2004
SP  - 1147
EP  - 1152
VL  - 44
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_6_a16/
LA  - ru
ID  - ZVMMF_2004_44_6_a16
ER  - 
%0 Journal Article
%A A. A. Kochkarov
%A R. A. Kochkarov
%T A parallel algorithm for searching for the shortest path on a prefractal graph
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2004
%P 1147-1152
%V 44
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_6_a16/
%G ru
%F ZVMMF_2004_44_6_a16
A. A. Kochkarov; R. A. Kochkarov. A parallel algorithm for searching for the shortest path on a prefractal graph. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 6, pp. 1147-1152. http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_6_a16/