.png){kind=icon}
.png){kind=icon}
Return
An efficient algorithm for computing network reliability in small treewidth
.png){kind=icon}
OA
AI
DOI：10.1016/j.ress.2019.106665.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Network reliability
Fixed-parameter algorithms
Tree decomposition
Treewidth
FPT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
R
IF:
11
Papers:
9.0K
Citations:
4.2W