This paper studies the problem of computing the source-to-terminal reliability, the probability that a source s can communicate with a terminal t, in a ...
An algorithm is presented for computing the reliability of any series-parallel graph irrespective of the vertices in K.
An O(IEI) algorithm is presented for computing the reliability of any series-parallel graph irrespective of the vertices in K, and a new set of ...
K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS. 821 degree 2. Replacing a pair of series (parallel) edges by a single edge is called a series. (parallel) ...
The K-terminal reliability of G, denoted $R(G_K )$, is the probability that all vertices in K are connected. Computing $R(G_K )$ is, in general, NP-hard. For ...
The $K$-terminal reliability of $G$, denoted $R(G_K )$, is the probability that all vertices in $K$ are connected. Computing $R(G_K )$ is, in general, NP-hard.
Nov 1, 2019 · PDF | In this paper, we will deal with 3-state devices networks' problem of computing k-terminal reliability .By using factoring theorem [1] ...
In this paper, we present a linear-time algorithm for finding ... A linear-time algorithm for computing K-terminal reliability in series-parallel networks.
A linear time algorithm for computing the most reliable source on a series ...
dl.acm.org › doi › abs
A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. Let $G = (V,E)$ be a graph whose edges may fail with known ...
Satyanarayana, R. K. Wood, "A linear-time algorithm for com- puting K-terminal reliability in series-parallel graphs", SIAM J. Computing, to appear. [27] R ...