Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs

DOI10.1007/s004530010022zbMath0971.68009OpenAlexW2045193931MaRDI QIDQ1578416

J.-F. Manouvrier, Corinne Lucet, Jacques Carlier

Publication date: 11 January 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010022

zbMATH Keywords

computational complexitydecomposition methodreliability problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Representing non-crossing cuts by phylogenetic trees ⋮ Models and methods for solving the problem of network vulnerability ⋮ Heuristic and metaheuristic methods for computing graph treewidth

This page was built for publication: Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs