We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
WAN Yingyu, XU Yinlong, GU Xiaodong, CHEN Guoliang. Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh[J]. Journal of Computer Science and Technology, 2000, 15(2): 116-125.
Citation: WAN Yingyu, XU Yinlong, GU Xiaodong, CHEN Guoliang. Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh[J]. Journal of Computer Science and Technology, 2000, 15(2): 116-125.

Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh

More Information
  • Published Date: March 09, 2000
  • The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, two efficient algorithms are proposed for computing the minimum spanning tree of an n-vertex undirected graph. One runs on an n×n reconfigurable mesh with time complexity of O(log~2 n). The other runs with time complexity of O(log …
  • [1]
    Kruskal J B. On the shortest subtree of a graph and the travelling salesman problem. In Proc. Amer. Math. Soc., 1956, 7(1): 48-50.
    [2]
    Prim R C. Shortest connection networks and some generalizations. Bell System Tech. J., 1957, 36(6): 1389-1401.
    [3]
    Sollin M. An Algorithm Attributed to Sollin. In Introduction to the Design and Analysis of Algorithms, Goodman S E, Hedetniemi S T (eds.), McGraw-Hill, 1977. ……….

Catalog

    Article views (12) PDF downloads (1395) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return