WORST-CASE ANALYSIS OF SET UNION ALGORITHMS

被引：268

作者：

TARJAN, RE ^{[1
]}

VANLEEUWEN, J ^{[1
]}

机构：

[1] STATE UNIV UTRECHT,DEPT COMP SCI,UTRECHT,NETHERLANDS

来源：

关键词：

D O I：

10.1145/62.2160

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：245 / 281

页数：37

共 14 条

[1] The Hilbert construction of real numbers [J].

Ackermann, W .

[2]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

BANACHOWSKI, L .

[4]

Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI

[5]

Fischer M. J., 1972, COMPLEXITY COMPUTER, P153

[6]

GABOW HN, 1983, 15TH P ANN ACM S THE, P246

[7] AN IMPROVED EQUIVALENCE ALGORITHM [J].

GALLER, BA ;

FISHER, MJ .

[8]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P294, DOI 10.1137/0202024

[9] NEW DATA STRUCTURE FOR THE UNION-FIND PROBLEM [J].

LAO, MJ .

[10] APPLICATIONS OF PATH COMPRESSION ON BALANCED TREES [J].

TARJAN, RE .