Splitting the K-Terminal Reliability

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

Let G=(V,E) be a graph and K a set of terminal vertices of G. Assume 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 article we propose an efficient splitting formula for R(G,K)
at a separating vertex set of G by lattice theoretic methods.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Splitting the K-Terminal Reliability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Splitting the K-Terminal Reliability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Splitting the K-Terminal Reliability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-71883

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.