Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein Networks

Figure 3

There are 𝑑 edge disjoint paths between 𝑠 and 𝑡. The first disjoint path shows two overlapping paths that share the first two and the last two edges on the path. Only one of these paths is used in reliability computation, that is, the one which maximizes flow. The reliability between 𝑠 and 𝑡 depends on the probability of at least one of these edge-disjoint paths being operational.