Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
An efficient algorithm for computing network reliability in small treewidth
HTML
PDF
Details
Locations
Year:
2019
Type:
article
Source:
Reliability Engineering & System Safety
DOI:
10.1016/j.ress.2019.106665
Authors:
Amir Kafshdar Goharshady,
Fatemeh Mohammadi
Institutions:
Institute of Science and Technology Austria,
University of Bristol
Language:
English
Topic:
Reliability and Maintenance Optimization
Subfield:
Safety, Risk, Reliability and Quality
Field:
Engineering
Domain:
Physical Sciences
Keywords:
network reliability,
treewidth,
tree decomposition,
exact algorithms,
NP-hard problems,
transit networks,
metro networks
show all 7
SDGs:
Industry, innovation and infrastructure,
Sustainable cities and communities
Open Access status:
bronze
Funders:
International Business Machines Corporation,
London Mathematical Society,
Österreichischen Akademie der Wissenschaften,
Engineering and Physical Sciences Research Council
Awards:
Matroids in Applied and Computational Algebra,
G4268661271
OpenAlex ID:
W2922032852
FWCI:
1.15
Cites:
39
Cited by:
20
Related to:
10