An efficient algorithm for computing network reliability in small treewidth

A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2019) 106665.

Download
No fulltext has been uploaded. References only!

Journal Article | Epub ahead of print | English
Author
;
Department
Abstract
We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard. We provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.
Publishing Year
Date Published
2019-09-18
Journal Title
Reliability Engineering and System Safety
Volume
193
Article Number
106665
ISSN
IST-REx-ID

Cite this

Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2019;193:106665. doi:10.1016/j.ress.2019.106665
Goharshady, A. K., & Mohammadi, F. (2019). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety, 193, 106665. https://doi.org/10.1016/j.ress.2019.106665
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety 193 (2019): 106665. https://doi.org/10.1016/j.ress.2019.106665.
A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193, p. 106665, 2019.
Goharshady AK, Mohammadi F. 2019. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, Elsevier, 2019, p. 106665, doi:10.1016/j.ress.2019.106665.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar