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 条
  • [41] Cutting-plane-based algorithms for two branch vertices related spanning tree problems
    Rossi, Andre
    Singh, Alok
    Sundar, Shyam
    OPTIMIZATION AND ENGINEERING, 2014, 15 (04) : 855 - 887
  • [42] Cutting-plane-based algorithms for two branch vertices related spanning tree problems
    André Rossi
    Alok Singh
    Shyam Sundar
    Optimization and Engineering, 2014, 15 : 855 - 887
  • [43] A Constant-Time Region-Based Memory Allocator for Embedded Systems with Unpredictable Length Array Generation
    Sanchez, Jordi
    Benet, Gines
    Simo, Jose E.
    2010 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2010,
  • [44] Efficient algorithms for the all nearest neighbor and closest pair problems on the linear array with a reconfigurable pipelined bus system
    Wang, YR
    Horng, SJ
    Wu, CH
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (03) : 193 - 206
  • [45] Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted 1 1 norm
    Jia, Junhua
    Guan, Xiucui
    Zhang, Binwu
    Qian, Xinqiang
    Pardalos, Panos M.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2024, 451
  • [46] Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem
    Shi, Feng
    Neumann, Frank
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2021, 893 : 159 - 175
  • [47] BIBLIOGRAPHY ON ALGORITHMS FOR SHORTEST PATH, SHORTEST SPANNING TREE, AND RELATED CIRCUIT ROUTING PROBLEMS (1956-1974).
    Pierce, A.R.
    Networks, 1975, 5 (02): : 129 - 149
12345