| Summary: | 碩士 === 國立中央大學 === 資訊及電子工程研究所 === 83 === Analysis of the network reliability is of major importance in
computer, communication, power networks, and other networks.
The $K$-terminal reliability problem is to compute the
probability that the $K$-vertices on the network are still
connected. In general, the problem is NP-hard in general graph.
For some special graphs (such as partial 2-trees), the K-
terminal reliability problem can be solved in linear time by a
sequential algorithm. In this paper, we present parallel
algorithms to solve the K-terminal reliability in 2-trees and
partial 2-trees with C(m, n) processors in O(log n) time 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.
|
|---|
