ALGORITHMS FOR UPDATING MINIMAL SPANNING TREES

被引：62

|

作者：

CHIN, F ^{[1
]}

HOUCK, D ^{[1
]}

机构：

[1] UNIV MARYLAND,DEPT MATH,CATONSVILLE,MD 21228

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1978年 / 16卷 / 03期

关键词：

D O I：

10.1016/0022-0000(78)90022-3

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：333 / 344

页数：12

相关论文

共 50 条

[1] Algorithms for finding and updating minimum-depth spanning trees in parallel
Chaudhuri, P
Ismaeel, AA
INFORMATION SCIENCES, 1995, 87 (1-3) : 171 - 183
[2] FAST ALGORITHMS FOR CONSTRUCTING MINIMAL SPANNING TREES IN COORDINATE SPACES
BENTLEY, JL
FRIEDMAN, JH
IEEE TRANSACTIONS ON COMPUTERS, 1978, 27 (02) : 97 - 105
[3] Minimal spanning trees
Schmerl, JH
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2004, 132 (02) : 333 - 340
[4] PARALLEL ALGORITHMS FOR COMPUTING MAXIMAL INDEPENDENT SETS IN TREES AND FOR UPDATING MINIMUM SPANNING-TREES
JUNG, H
MEHLHORN, K
INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 227 - 236
[5] MINIMAL SPANNING-TREES - AN EMPIRICAL-INVESTIGATION OF PARALLEL ALGORITHMS
BARR, RS
HELGAON, RV
KENNINGTON, JL
PARALLEL COMPUTING, 1989, 12 (01) : 45 - 52
[6] PARALLEL ALGORITHMS FOR MINIMAL SPANNING-TREES OF DIRECTED-GRAPHS
ZHANG, YX
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1989, 18 (03) : 205 - 221
[7] MINIMAL RATIO SPANNING TREES
CHANDRASEKARAN, R
NETWORKS, 1977, 7 (04) : 335 - 342
[8] Percolation and Minimal Spanning Trees
Carol Bezuidenhout
Geoffrey Grimmett
Armin Löffler
Journal of Statistical Physics, 1998, 92 : 1 - 34
[9] Percolation and minimal spanning trees
Bezuidenhout, C
Grimmett, G
Loffler, A
JOURNAL OF STATISTICAL PHYSICS, 1998, 92 (1-2) : 1 - 34
[10] Updating directed minimum cost spanning trees
Pollatos, Gerasimos G.
Telelis, Orestis A.
Zissimopoulos, Vassilis
EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 291 - 302

← 1 2 3 4 5 →