A NEW ALGORITHM TO FIND THE SHORTEST PATHS BETWEEN ALL PAIRS OF NODES

被引：15

作者：

GALLO, G ^{[1
]}

PALLOTTINO, S ^{[1
]}

机构：

[1] CNR,IST APPL CALCOLO,ROME,ITALY

来源：

DISCRETE APPLIED MATHEMATICS | 1982年 / 4卷 / 01期

关键词：

D O I：

10.1016/0166-218X(82)90031-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：23 / 35

页数：13

共 24 条

[1] DUAL SHORTEST PATH ALGORITHM [J].

BAZARAA, MS ;

LANGLEY, RW .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (03) :496-501

[2]

Bellman R., 1958, Q APPL MATH, V16, P87

[3] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].

DENARDO, EV ;

FOX, BL .

OPERATIONS RESEARCH, 1979, 27 (01) :161-186

[4]

DIAL R, 1977, CCS291 U TEX RES REP

[5] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].

DIAL, RB .

COMMUNICATIONS OF THE ACM, 1969, 12 (11) :632-&

[6]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[7] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

OPERATIONS RESEARCH, 1969, 17 (03) :395-&

[8] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[9]

FLORIAN MA, 1977, P IEEE C DEC CONTROL

[10] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345

← 1 2 3 →