Abstract
We develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. We also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. Our 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.
Original language | English |
---|---|
Pages (from-to) | 603-607 |
Number of pages | 5 |
Journal | Proceedings of the International Parallel Processing Symposium, IPPS |
State | Published - 1997 |
Event | Proceedings of the 1997 11th International Parallel Processing Symposium, IPPS 97 - Geneva, Switz Duration: 1 Apr 1997 → 5 Apr 1997 |