LINEAR VERIFICATION FOR SPANNING-TREES

被引：32

作者：

KOMLOS, J

机构：

[1] HUNGARIAN ACAD SCI,INST MATH,H-1364 BUDAPEST,HUNGARY

[2] UNIV CALIF SAN DIEGO,LA JOLLA,CA 92093

来源：

关键词：

D O I：

10.1007/BF02579443

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：57 / 65

页数：9

共 6 条

[1]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[2]

FREDMAN M, 1983, COMMUNICATION DEC

[3] INFORMATION BOUNDS ARE WEAK IN THE SHORTEST DISTANCE PROBLEM [J].

GRAHAM, RL ;

YAO, AC ;

YAO, FF .

[4]

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

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

TARJAN, RE .

[6]

Yao A. C., 1975, Information Processing Letters, V4, P21, DOI 10.1016/0020-0190(75)90056-3