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 条
  • [21] A comparison of encodings and algorithms for multiobjective minimum spanning tree problems
    Knowles, JD
    Corne, DW
    PROCEEDINGS OF THE 2001 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2001, : 544 - 551
  • [22] Constant time graph algorithms on the reconfigurable multiple bus machine
    Trahan, JL
    Vaidyanathan, R
    Subbaraman, CP
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 46 (01) : 1 - 14
  • [23] PARALLEL ALGORITHMS FOR ADDITION AND MULTIPLICATION ON PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS
    THANGAVEL, P
    MUTHUSWAMY, VP
    INFORMATION PROCESSING LETTERS, 1993, 46 (02) : 89 - 94
  • [24] COST-EFFECTIVE ALGORITHMS FOR PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS
    LIN, SS
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 1994, 17 (02) : 279 - 288
  • [25] Parallel directed graph algorithms on directional processor arrays with reconfigurable bus systems
    Kuo, CJ
    Hsu, CC
    Fang, WC
    NEW GENERATION COMPUTING, 1999, 17 (02) : 175 - 200
  • [26] Parallel directed graph algorithms on directional processor arrays with reconfigurable bus systems
    Chi-Jung Kuo
    Chiun-Chieh Hsu
    Wei-Chen Fang
    New Generation Computing, 1999, 17 : 175 - 200
  • [27] Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
    Johnson, D.B.
    Metaxas, P.
    Algorithmica (New York), 1996, 16 (06):
  • [28] Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups
    Lorenzo-Freire, S.
    Gonzalez-Maestro, A.
    Alonso-Meijide, J. M.
    DISCRETE APPLIED MATHEMATICS, 2023, 338 : 113 - 124
  • [29] Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
    Johnson, DB
    Metaxas, P
    ALGORITHMICA, 1996, 16 (06) : 633 - 648
  • [30] IMPROVED CONSTANT-TIME APPROXIMATION ALGORITHMS FOR MAXIMUM MATCHINGS AND OTHER OPTIMIZATION PROBLEMS
    Yoshida, Yuichi
    Yamamoto, Masaki
    Ito, Hiro
    SIAM JOURNAL ON COMPUTING, 2012, 41 (04) : 1074 - 1093