DocumentCode
1013971
Title
On Onaga´s upper bound on the mean values of probabilistic maximum flows
Author
Nagamochi, Hiroshi ; Ibaraki, Toshihide
Author_Institution
Dept. of Appl. Math. & Phys., Kyoto Univ., Japan
Volume
41
Issue
2
fYear
1992
fDate
6/1/1992 12:00:00 AM
Firstpage
225
Lastpage
229
Abstract
The reliability of capacity-limited networks subject to arc failures is evaluated by the mean value of maximum flow. Calculating the mean value of maximum flow is NP-hard. However, the Onaga upper bound sometimes gives the exact value, e.g. when graphs are bipartite. The authors give, for networks, whether arcs are directed or not, a necessary and sufficient condition for the Onaga upper bound to be exact
Keywords
graph theory; reliability theory; NP-hard; Onaga upper bound; arc failures; bipartite graphs; capacity-limited networks; directed graphs; mean maximum flow; probabilistic maximum flows; reliability; Algorithm design and analysis; Polynomials; Power measurement; Power system modeling; Power system reliability; Reliability theory; Road transportation; Sufficient conditions; Telecommunication network reliability; Upper bound;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.257785
Filename
257785
Link To Document