A NOTE ON THE PROBLEM OF UPDATING SHORTEST PATHS

被引：12

作者：

FUJISHIGE, S

机构：

来源：

关键词：

D O I：

10.1002/net.3230110309

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：317 / 319

页数：3

共 6 条

[1] Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[2] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS
EDMONDS, J
KARP, RM
[J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &
[3] NEW SHORTEST PATH UPDATING ALGORITHM
GOTO, S
SANGIOVANNIVINCENTELLI, A
[J]. NETWORKS, 1978, 8 (04) : 341 - 372
[4] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS
JOHNSON, DB
[J]. JOURNAL OF THE ACM, 1977, 24 (01) : 1 - 13
[5] Rodionov V, 1968, USSR COMP MATH MATH, V8, P336
[6] Tomizawa N., 1971, Networks, V1, P173, DOI 10.1002/net.3230010206