FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS

被引：1543

作者：

FREDMAN, ML ^{[1
]}

TARJAN, RE ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1145/28869.28874

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：596 / 615

页数：20

共 28 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2] IMPLEMENTATION AND ANALYSIS OF BINOMIAL QUEUE ALGORITHMS
BROWN, MR
[J]. SIAM JOURNAL ON COMPUTING, 1978, 7 (03) : 298 - 319
[3] NOTE ON FINDING OPTIMUM BRANCHINGS
CAMERINI, PM
FRATTA, L
MAFFIOLI, F
[J]. NETWORKS, 1979, 9 (04) : 309 - 312
[4] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051
[5] Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390
[6] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS
EDMONDS, J
KARP, RM
[J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &
[7] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS
GABOW, HN
GALIL, Z
SPENCER, T
TARJAN, RE
[J]. COMBINATORICA, 1986, 6 (02) : 109 - 122
[8] GABOW HN, 1985, LECT NOTES COMPUT SC, V194, P210
[9] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS
GABOW, HN
TARJAN, RE
[J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 80 - 131
[10] GABOW HN, 1984, 25TH P ANN IEEE S F, P338