A simple parallel tree contraction algorithm
Journal of Algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel recognition of series-parallel graphs
Information and Computation
Finding the most vital edge with respect to K-terminal reliability in series-parallel networks
Proceedings of the 15th annual conference on Computers and industrial engineering
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.00 |
The authors develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. They also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. The algorithms take O(log n) time with C(m,n) processors on a CRCW PRAM, where C(m,n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time.