Maximum flow in probabilistic graphs‐the discrete case

This publication has 11 references indexed in Scilit:

• Probability distribution function for the capacity of a multiterminal network
  Revue française d'informatique et de recherche opérationnelle. Série verte, 1971
• An Implicit Enumeration Scheme for Proper Cut Generation
  Technometrics, 1970
• An Implicit Enumeration Scheme for Proper Cut Generation
  Technometrics, 1970
• Shortest Paths in Probabilistic Graphs
  Operations Research, 1969
• Estimation of terminal capacity in probabilistic communication nets
  Journal of the Franklin Institute, 1969
• Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks
  Management Science, 1968
• Probabilistic Flows Through a Communication Network
  IEEE Transactions on Circuit Theory, 1965
• Flows in Networks
  Published by Walter de Gruyter GmbH ,1963
• Linear Programming and Extensions
  Published by Walter de Gruyter GmbH ,1963
• Theory of Graphs
  Published by American Mathematical Society (AMS) ,1962