A decomposition algorithm for network reliability evaluation
From MaRDI portal
Publication:1917266
DOI10.1016/0166-218X(95)00032-MzbMath0848.90058OpenAlexW2074342195MaRDI QIDQ1917266
Jacques Carlier, Corinne Lucet
Publication date: 24 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)00032-m
Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Reliability evaluation of large telecommunication networks ⋮ Computing diameter constrained reliability of a network with junction points ⋮ An exact method for graph coloring ⋮ Unnamed Item ⋮ Heuristic and metaheuristic methods for computing graph treewidth
Cites Work
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Factoring and reductions for networks with imperfect vertices
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Triconnected decomposition for computingK-terminal network reliability
- Computing the Reliability of Complex Networks
- Network reliability and the factoring theorem
- Dividing a Graph into Triconnected Components