AN ALGORITHM FOR GEOMETRIC MINIMUM SPANNING-TREES REQUIRING NEARLY LINEAR EXPECTED TIME

被引：3

|

作者：

CLARKSON, KL

机构：

来源：

ALGORITHMICA | 1989年 / 4卷 / 04期

关键词：

D O I：

10.1007/BF01553902

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：461 / 469

页数：9

相关论文

共 50 条

[21] LOW-DEGREE MINIMUM SPANNING-TREES
ROBINS, G
SALOWE, JS
DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 14 (02) : 151 - 165
[22] MINIMUM DIAMETER SPANNING-TREES AND RELATED PROBLEMS
HO, JM
LEE, DT
CHANG, CH
WONG, CK
SIAM JOURNAL ON COMPUTING, 1991, 20 (05) : 987 - 997
[23] Randomized linear-time algorithm to find minimum spanning trees
Stanford Univ, Stanford, United States
J Assoc Comput Mach, 2 (321-328):
[24] MINIMUM SPANNING-TREES OF MOVING POINTS IN THE PLANE
FU, JJ
LEE, RCT
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (01) : 113 - 118
[25] SEGMENTATION OF IMAGES USING MINIMUM SPANNING-TREES
SUK, M
CHO, TH
PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS, 1983, 397 : 180 - 185
[26] BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
KHULLER, S
RAGHAVACHARI, B
YOUNG, N
ALGORITHMICA, 1995, 14 (04) : 305 - 321
[27] RELATIONSHIP BETWEEN MINIMUM SPANNING-TREES AND ADDITIVE PHYLOGENETIC TREES
ZONTASGARAMELLA, L
ATTI ASSOCIAZIONE GENETICA ITALIANA, 1981, 27 : 414 - 415
[28] MINIMUM SPANNING-TREES IN K-DIMENSIONAL SPACE
VAIDYA, PM
SIAM JOURNAL ON COMPUTING, 1988, 17 (03) : 572 - 582
[29] EUCLIDEAN MINIMUM SPANNING-TREES AND BICHROMATIC CLOSEST PAIRS
AGARWAL, PK
EDELSBRUNNER, H
SCHWARZKOPF, O
WELZL, E
DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (05) : 407 - 422
[30] DO NEARLY BALANCED MULTIGRAPHS HAVE MORE SPANNING-TREES
CHENG, CS
MASARO, JC
WONG, CS
JOURNAL OF GRAPH THEORY, 1985, 9 (03) : 342 - 345

← 1 2 3 4 5 →