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 条

[31] An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
Hagerup, Torben
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 5911 : 178 - 189
[32] 2-CACTI WITH MINIMUM NUMBER OF SPANNING-TREES
VESTERGAARD, PD
DISCRETE MATHEMATICS, 1994, 124 (1-3) : 241 - 250
[33] SPANNING-TREES IN GRAPHS OF MINIMUM DEGREE 4 OR 5
GRIGGS, JR
WU, MS
DISCRETE MATHEMATICS, 1992, 104 (02) : 167 - 183
[34] ON MINIMUM AND MAXIMUM SPANNING-TREES OF LINEARLY MOVING POINTS
KATOH, N
TOKUYAMA, T
IWANO, K
DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 13 (02) : 161 - 176
[35] ON HANDLING VERTEX DELETION IN UPDATING MINIMUM SPANNING-TREES
TSIN, YH
INFORMATION PROCESSING LETTERS, 1988, 27 (04) : 167 - 168
[36] MINIMUM SPANNING-TREES FOR TREE METRICS - ABRIDGMENTS AND ADJUSTMENTS
LECLERC, B
JOURNAL OF CLASSIFICATION, 1995, 12 (02) : 207 - 241
[37] THE RELATIVE NEIGHBORHOOD GRAPH, WITH AN APPLICATION TO MINIMUM SPANNING-TREES
SUPOWIT, KJ
JOURNAL OF THE ACM, 1983, 30 (03) : 428 - 448
[38] SENSITIVITY ANALYSIS OF MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
TARJAN, RE
INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 30 - 33
[39] A PARALLEL ALGORITHM FOR THE ENUMERATION OF THE SPANNING-TREES OF A GRAPH
MAI, SW
EVANS, DJ
PARALLEL COMPUTING, 1984, 1 (3-4) : 275 - 286
[40] A DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING-TREES
DALAL, YK
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1987, 13 (03) : 398 - 405

← 1 2 3 4 5 →