FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS

被引：717

作者：

HAREL, D

TARJAN, RE

机构：

[1] UNIV NEW HAMPSHIRE,DURHAM,NH 03824

[2] BELL TEL LABS INC,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1137/0213024

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：338 / 355

页数：18

共 15 条

[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]

FREDMAN ML, 1975, 7TH P ANN ACM S THEO, P240

[4]

GABOW HN, UNPUB J COMP SYS SCI

[5]

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

[6]

Harel D., 1980, 21st Annual Symposium on Foundations of Computer Science, P308, DOI 10.1109/SFCS.1980.6

[7]

Knuth, 2010, COMBINATORIAL ALGORI, V4

[8] EFFICIENT METHOD FOR STORING ANCESTOR INFORMATION IN TREES [J].

MAIER, D .

[9] STORAGE MODIFICATION MACHINES [J].

SCHONHAGE, A .

[10] A DATA STRUCTURE FOR DYNAMIC TREES [J].

SLEATOR, DD ;

TARJAN, RE .