Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

2003 ◽  
Author(s):  
Li-Jen Mao ◽  
Sheau-Dong Lang
Keyword(s):  
Parallel Algorithms ◽  
Spanning Tree ◽  
Nearest Neighbor ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem

scholarly journals Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem

1997 ◽  
Vol 07 (01) ◽  
pp. 25-37 ◽  
Author(s):  
Christos D. Zaroliagis
Keyword(s):  
Parallel Algorithms ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Erew Pram ◽  
Minimum Spanning Tree Problem ◽  
Crcw Pram

Two Simple and work-efficient parallel algorithms for the minimum spanning tree problem are presented. Both algorithms perform O(m log n) work. The first algorithm runs in O( log 2 n) time on an EREW PRAM, while the second algorithm runs in O( log n) time on a COMMON CRCW PRAM.

Efficient distributed algorithm to solve updating minimum spanning tree problem

1992 ◽  
Vol 23 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Jungho Park ◽  
Ken'Ichi Hagihara ◽  
Nobuki Tokura ◽  
Toshimitsu Masuzawa
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem
Sign in / Sign up

Export Citation Format

Share Document