A block-parametric method for finding shortest paths in a graph
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 4, pp. 690-696

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

@article{ZVMMF_1999_39_4_a17,
     author = {V. V. Rodionov},
     title = {A block-parametric method for finding shortest paths in a graph},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {690--696},
     publisher = {mathdoc},
     volume = {39},
     number = {4},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_4_a17/}
}
TY  - JOUR
AU  - V. V. Rodionov
TI  - A block-parametric method for finding shortest paths in a graph
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 690
EP  - 696
VL  - 39
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_4_a17/
LA  - ru
ID  - ZVMMF_1999_39_4_a17
ER  - 
%0 Journal Article
%A V. V. Rodionov
%T A block-parametric method for finding shortest paths in a graph
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 690-696
%V 39
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_4_a17/
%G ru
%F ZVMMF_1999_39_4_a17
V. V. Rodionov. A block-parametric method for finding shortest paths in a graph. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 4, pp. 690-696. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_4_a17/