Splitting the K-terminal reliability
Presented by Mr. Frank SIMON
Type: Oral presentation
Track: General session
Let G=(V,E) be a graph and K a subset of vertices in V. Assume now that the edges of G are failing independently with given probabilities. The K-terminal reliability R(G,K) is the probability that all vertices in K are mutually connected. In this talk a new approach for the computation of R(G,K) at a vertex separating set of G is proposed by means of lattice theoretic methods.