@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},
year = {1999},
volume = {39},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/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/
[1] Ore O., Teoriya grafov, Nauka, M., 1968 | MR
[2] Rodionov V. V., “Novye napravleniya v otyskanii kratchaishikh rasstoyanii”, Vopr. sozdaniya avtomatizirovannykh sistem upravleniya, MESI, M., 1972, 16–19
[3] Floyd R. W., “Shortest paths”, Communs ACM, 5 (1962), 945
[4] Rodionov V. V., “Parametricheskaya zadacha o kratchaishikh rasstoyaniyakh”, Zh. vychisl. matem. i matem. fiz., 8:5 (1968), 1173–1177 | MR
[5] Dantzig G. B., “On the shortest route through a network”, Management Sci., 6 (1960), 653–670 | MR
[6] Hu T. C., “Revised matrix algorithms for shortest paths”, SIAM J. Appl. Math., 15:1 (1967), 155–159 | MR
[7] Rodionov V. V., Matrichnyi metod otyskaniya kratchaishikh rasstoyanii, Avtoref. dis. kand. fiz.-matem. nauk, VTs AN SSSR, M., 1971