Constant-time algorithms for minimum spanning tree and related problems on processor array with reconfigurable bus systems

被引：0

作者：

Pan, Tien-Tai ^{[1
]}

Lin, Shun-Shii ^{[1
]}

机构：

[1] Dept. of Info. and Comp. Education, National Taiwan Normal University, Taipei, 10610, Taiwan

来源：

| 1600年 / Oxford University Press卷 / 45期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 47 条

[31] Constant-time RMESH algorithms for the range minima and co-minima problems
Kim, SK
PARALLEL COMPUTING, 1998, 24 (5-6) : 965 - 977
[32] Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems
P Thangavel
Sadhana, 1997, 22 : 629 - 636
[33] Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems
Thangavel, P
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 1997, 22 (5): : 629 - 636
[34] A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems
Gustavo Bergantiños
Juan Vidal-Puga
SERIEs, 2021, 12 : 73 - 100
[35] Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
Li, KQ
Pan, Y
Zheng, SQ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (08) : 705 - 720
[36] Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
State Univ of New York, New Paltz, United States
IEEE Trans Parallel Distrib Syst, 8 (705-720):
[37] A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems
Bergantinos, Gustavo
Vidal-Puga, Juan
SERIES-JOURNAL OF THE SPANISH ECONOMIC ASSOCIATION, 2021, 12 (01): : 73 - 100
[38] Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
Keqin Li
The Journal of Supercomputing, 1997, 11 : 391 - 403
[39] Constant time Boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system
Li, KQ
JOURNAL OF SUPERCOMPUTING, 1997, 11 (04): : 391 - 403
[40] Constant time algorithms for graph connectivity problems on reconfigurable meshes using fewer processors
Kao, TW
Horng, SJ
Guo, YH
INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1996, 8 (04): : 371 - 385

← 1 2 3 4 5 →