On Onaga's upper bound on the mean values of probabilistic maximum flows

DOI10.1109/24.257785MaRDI QIDQ4018972zbMATHOpenAlexFDO

Authors Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 16 January 1993

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/24.257785

zbMATH Keywords

maximum flowupper boundreliability networksmaxflow- mincut algorithmsOnaga bound

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)

Recommendations

• Maximum flows in probabilistic networks
• The maximum flow problem in a network with special conditions of flow distribution
• An approach to calculating the probability of retaining the maximal flow
• Bounds on expected performance of networks with links subject to failure
• A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs

Cited in

(2)

• Bounds on expected performance of networks with links subject to failure
• An approach to calculating the probability of retaining the maximal flow

This page was built for publication: On Onaga's upper bound on the mean values of probabilistic maximum flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018972)