Jun, 1995
On Lower Bound for Network Reliability by Edge-packing
Transactions of the Japan Society for Industrial and Applied Mathematics
- ,
- ,
- Volume
- 5
- Number
- 2
- First page
- 139
- Last page
- 151
- Language
- Japanese
- Publishing type
- Research paper (scientific journal)
- DOI
- 10.11540/jsiamt.5.2_139
- Publisher
- The Japan Society for Industrial and Applied Mathematics
A simple model for a communication network is a probabilistic graph consisting of a set of nodes which is not fail and a set of edges which operates with a probability. One of the indicators which measure the performance of the network is all-terminal reliability, that is, probability that all nodes are connected with operational edges. Since to calculate its value precisely is NP-hard, it is important to obtain the bounds of the all-terminal reliability efficiently. In this paper, we propose the polynomial time algorithm that can derive the lower bound by transforming any graph to the grap...
- Link information
-
- DOI
- https://doi.org/10.11540/jsiamt.5.2_139
- CiNii Articles
- http://ci.nii.ac.jp/naid/110001882378
- CiNii Books
- http://ci.nii.ac.jp/ncid/AN10367166
- ID information
-
- DOI : 10.11540/jsiamt.5.2_139
- ISSN : 0917-2246
- CiNii Articles ID : 110001882378
- CiNii Books ID : AN10367166