An efficient algorithm for computing network reliability in small treewidth

•We provide an efficient parameterized algorithm that is able to compute network reliability on graphs with small treewidth in linear time.•Small-treewidth graphs are the most general family of graphs for which efficient algorithms for computing network reliability are known (to date).•Our algorithm...

Full description

Saved in:

Bibliographic Details
Published in:	Reliability engineering & system safety Vol. 193; p. 106665
Main Authors:	Goharshady, Amir Kafshdar, Mohammadi, Fatemeh
Format:	Journal Article
Language:	English
Published:	Barking Elsevier Ltd 01.01.2020 Elsevier BV
Subjects:	Algorithms Apexes Fixed-parameter algorithms FPT Graph theory Network reliability Reliability engineering Subways System reliability Transportation networks Tree decomposition Treewidth Fixed-parameter algorithms Tree decomposition Network reliability FPT Treewidth
ISSN:	0951-8320, 1879-0836
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!