EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS

被引：624

作者：

JOHNSON, DB ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,WHITMORE LAB,UNIVERSITY PK,PA 16802

来源：

关键词：

D O I：

10.1145/321992.321993

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1 / 13

页数：13

共 33 条

[1]

AHO AV, 1974, DESIGN ANALYSIS COMP

[2]

[Anonymous], THESIS U CALIFORNIA

[3]

[Anonymous], 1973, The Art of Computer Programming

[4]

Bellman R., 1958, Quarterly of applied mathematics, V16, P87

[5]

BERGE C, 1958, THEORIE GRAPHS SES A

[6] ON THE SHORTEST ROUTE THROUGH A NETWORK [J].

DANTZIG, GB .

[7]

DANTZIG GB, 1967, 1966 P INT S THEOR G, P91

[8]

Dijkstra E.W., 1959, Numerische mathematik, V1, P269, DOI 10.1007/BF01386390

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

DREYFUS, SE .

EDMONDS, J ;

KARP, RM .