EFFICIENT ALGORITHM FOR SOLVING SHORTEST-ROUTE PROBLEMS

被引：0

作者：

TOMIZAWA, N ^{[1
]}

机构：

[1] TOKYO INST TECHNOL,GRAD SCH SCI & ENGN,TOKYO 152,JAPAN

来源：

ELECTRONICS & COMMUNICATIONS IN JAPAN | 1976年 / 59卷 / 07期

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：1 / 8

页数：8

共 13 条

[1] DANTZIG GB, 1967, 1966 P INT S ROM, P85
[2] Dijkstra E., 1959, NUMER MATH, V1, P269
[3] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS
DREYFUS, SE
[J]. OPERATIONS RESEARCH, 1969, 17 (03) : 395 - &
[4] ALGORITHM-97 - SHORTEST PATH
FLOYD, RW
[J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345
[5] FINDING ALL SHORTEST DISTANCES IN A DIRECTED NETWORK
HOFFMAN, AJ
WINOGRAD, S
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1972, 16 (04) : 412 - &
[6] JOHNSON EL, 1972, 25TH P ACM ANN C BOS, V1, P510
[7] Knuth D. E., 1973, ART COMPUTER PROGRAM
[8] MASAO I, 1972, MANAGEMENT SCI, V16, P15
[9] NOSHITA K, 1973, DATA STRUCTURES MANI
[10] Tomizawa N., 1971, Networks, V1, P173, DOI 10.1002/net.3230010206