𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient minimum spanning tree algorithms on the reconfigurable mesh

✍ Scribed by Yingyu Wan; Yinlong Xu; Xiaodong Gu; Guoliang Chen

Publisher
Springer
Year
2000
Tongue
English
Weight
831 KB
Volume
15
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improving the efficiency of parallel min
Improving the efficiency of parallel minimum spanning tree algorithms
✍ Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 203 KB

This paper presents results which improve the e ciency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n) log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m

Time-Efficient Maze Routing Algorithms o
Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures
✍ F Ercal; H.C Lee πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 396 KB

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm (1961, IRE Trans. Electron. Comput. (Sept.), 34

Efficient distributed algorithm to solve
Efficient distributed algorithm to solve updating minimum spanning tree problem
✍ Jungho Park; Ken'Ichi Hagihara; Nobuki Tokura; Toshimitsu Masuzawa πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 983 KB

## Abstract This paper proposes a distributed algorithm for reconstructing a minimum‐weight spanning tree __T__β€² of a network __N__β€² when link addition and deletion occur in a network __N__ with a minimum‐weight spanning tree __T.__ In this algorithm each processor uses information whose adjacent l