Parallel algorithms for finding the most vital edge with respect to minimum spanning tree.
Lih-Hsing HsuPeng-Fei WangChu-Tao WuPublished in: Parallel Comput. (1992)
Keyphrases
- parallel algorithm
- minimum spanning tree
- weighted graph
- minimum spanning trees
- spanning tree
- parallel computation
- shared memory
- edge weights
- parallel implementations
- parallel programming
- graph theory
- traveling salesman problem
- pc cluster
- steiner tree
- discovery of association rules
- cluster of workstations
- shortest path
- neighborhood structure
- parallel version
- combinatorial search problems