Maximum flow in probabilistic graphs‐the discrete case
James R. Evans · Networks · 1976
Abstract Frank and Frisch have considered the problem of determining the maximum flow probability distribution in networks where each branch has capacity that is a continuous random variable. In this paper, we consider the branch capacity distributions to be discrete and investigate some theoretical properties of the problem under this assumption.