O(n(dot)log(n)) Algorithm to Compute the All-Terminal Reliability of (K sub 5, Ksub 2,2,2) Free Networks

摘要

Consider an undirected network G in which the points are perfectly reliable butthe edges can fail, s-independently of each other, with known probabilities. An edge is failed when it does not provide a link between its two incident points; otherwise it is operating.