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 条

[41] Geometric Minimum Spanning Trees with GEOFILTERKRUSKAL
Chatterjee, Samidh
Connor, Michael
Kumar, Piyush
EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 486 - 500
[42] DYNAMIC EUCLIDEAN MINIMUM SPANNING-TREES AND EXTREMA OF BINARY FUNCTIONS
EPPSTEIN, D
DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 13 (01) : 111 - 122
[43] On the Difference of Expected Lengths of Minimum Spanning Trees
Li, Wenbo V.
Zhang, Xinyi
COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (03) : 423 - 434
[44] A linear-time optimal-message distributed algorithm for minimum spanning trees
Michalis Faloutsos
Mart Molle
Distributed Computing, 2004, 17 : 151 - 170
[45] A linear-time optimal-message distributed algorithm for minimum spanning trees
Faloutsos, M
Molle, M
DISTRIBUTED COMPUTING, 2004, 17 (02) : 151 - 170
[46] CURVILINEAR FEATURE-EXTRACTION USING MINIMUM SPANNING-TREES
SUK, MS
SONG, OY
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 26 (03): : 400 - 411
[47] MINIMUM PERFECT BIPARTITE MATCHINGS AND SPANNING-TREES UNDER CATEGORIZATION
RICHEY, MB
PUNNEN, AP
DISCRETE APPLIED MATHEMATICS, 1992, 39 (02) : 147 - 153
[48] A NEARLY OPTIMAL PARALLEL ALGORITHM FOR CONSTRUCTING DEPTH 1ST SPANNING-TREES IN PLANAR GRAPHS
HE, X
YESHA, Y
SIAM JOURNAL ON COMPUTING, 1988, 17 (03) : 486 - 491
[49] OPTIMAL PARALLEL ALGORITHMS FOR MULTIPLE UPDATES OF MINIMUM SPANNING-TREES
PAWAGI, S
KASER, O
ALGORITHMICA, 1993, 9 (04) : 357 - 381
[50] MINIMAX LENGTH LINKS OF A DISSIMILARITY MATRIX AND MINIMUM SPANNING-TREES
CARROLL, JD
PSYCHOMETRIKA, 1995, 60 (03) : 371 - 374

← 1 2 3 4 5 →