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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Reliability engineering & system safety Ročník 193; s. 106665
Hlavní autori:	Goharshady, Amir Kafshdar, Mohammadi, Fatemeh
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Barking Elsevier Ltd 01.01.2020 Elsevier BV
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!