A LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION

被引：341

作者：

GABOW, HN ^{[1
]}

TARJAN, RE ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1016/0022-0000(85)90014-5

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：209 / 221

页数：13

共 32 条

[1] Aho A. V., 1976, SIAM Journal on Computing, V5, P115, DOI 10.1137/0205011
[2] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[3] Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
[4] Doyle J., 1976, Information Processing Letters, V5, P146, DOI 10.1016/0020-0190(76)90061-2
[5] SCHEDULING UNIT-TIME TASKS WITH INTEGER RELEASE TIMES AND DEADLINES
FREDERICKSON, GN
[J]. INFORMATION PROCESSING LETTERS, 1983, 16 (04) : 171 - 173
[6] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS
GABOW, HN
[J]. INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 20 - 22
[7] EFFICIENT IMPLEMENTATION OF EDMONDS ALGORITHM FOR MAXIMUM MATCHING ON GRAPHS
GABOW, HN
[J]. JOURNAL OF THE ACM, 1976, 23 (02) : 221 - 234
[8] AN ALMOST-LINEAR ALGORITHM FOR 2-PROCESSOR SCHEDULING
GABOW, HN
[J]. JOURNAL OF THE ACM, 1982, 29 (03) : 766 - 780
[9] GABOW HN, 1983, 15TH P ANN ACM S THE, P246
[10] FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS
HAREL, D
TARJAN, RE
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (02) : 338 - 355