Premium
Maximum flow in probabilistic graphs‐the discrete case
Author(s) -
Evans J. R.
Publication year - 1976
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230060208
Subject(s) - probabilistic logic , maximum flow problem , random variable , mathematics , flow (mathematics) , probability distribution , flow network , mathematical optimization , variable (mathematics) , random graph , combinatorics , graph , statistics , mathematical analysis , geometry
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.