Determination of the most reliable path of a planar flow network
โ Scribed by Dong Wha Lee; Bong Jin Yum
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 406 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0951-8320
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Determination of minimal upper paths is an important step in calculating the reliability (i.e. the probability that a required amount of flow can be transmitted from a source to a terminal) of stochastic flow networks. This paper presents an algorithm for determining minimal upper paths of a planar
The most vital link in a single commodity flow network is that arc whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the networ