Abstract
The problem of computing performability probabilities in stochastic PERT and flow networks is studied when the network is “minimally designed” to withstand any two component failures. Polynomial-time algorithms to compute performability when the network is planar — the non-planar versions being NP-hard — solve related “two-path subset” problems. Given an acyclic graph with weights on the arcs, the algorithms compute the total weight of all subsets of arcs that are contained in 1. (1) two source-sink paths, or 2. (2) two arc-disjoint source-sink paths. A polynomial algorithm is given for (1), and for (2) in the case where the graph is a source-sink planar k-flow graph, that is, edge-minimal with respect to supporting k units of flow.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
