Algorithm for geometric minimum spanning trees requiring nearly linear expected time

被引：0

|

作者：

机构：

[1] Clarkson, Kenneth L.

来源：

Clarkson, Kenneth L. | 1600年 / 04期

关键词：

Mathematical Techniques;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] An improved clustering algorithm for minimum spanning trees in multidimensional data
Xie, Zhi-Qiang
Yu, Liang
Yang, Jing
Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2008, 29 (08): : 851 - 857
[42] A PARALLEL ALGORITHM FOR MULTIPLE UPDATES OF MINIMUM SPANNING-TREES
PAWAGI, S
PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 3: ALGORITHMS AND APPLICATIONS, 1989, : 9 - 15
[43] Concurrent threads and optimal parallel minimum spanning trees algorithm
Chong, KW
Han, YJ
Lam, TW
JOURNAL OF THE ACM, 2001, 48 (02) : 297 - 323
[44] INCREMENTAL DISTRIBUTED ASYNCHRONOUS ALGORITHM FOR MINIMUM SPANNING-TREES
TSIN, YH
COMPUTER NETWORKS AND ISDN SYSTEMS, 1993, 26 (02): : 227 - 232
[45] A PARALLEL VERTEX INSERTION ALGORITHM FOR MINIMUM SPANNING-TREES
VARMAN, P
DOSHI, K
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 424 - 433
[46] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES
GALLAGER, RG
HUMBLET, PA
SPIRA, PM
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01): : 66 - 77
[47] AN EFFICIENT PARALLEL ALGORITHM FOR UPDATING MINIMUM SPANNING-TREES
VARMAN, P
DOSHI, K
THEORETICAL COMPUTER SCIENCE, 1988, 58 (1-3) : 379 - 397
[48] AN ALGORITHM FOR FINDING K-MINIMUM SPANNING-TREES
KATOH, N
IBARAKI, T
MINE, H
SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 247 - 255
[49] A DISTRIBUTED ALGORITHM FOR MINIMUM WEIGHT DIRECTED SPANNING-TREES
HUMBLET, PA
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (06) : 756 - 762
[50] A fast algorithm for computing minimum routing cost spanning trees
Campos, Rui
Ricardo, Manuel
COMPUTER NETWORKS, 2008, 52 (17) : 3229 - 3247

← 1 2 3 4 5 →