A decomposition algorithm for network reliability evaluation
type: Item
instance of: scholarly article
title: A decomposition algorithm for network reliability evaluation
zbMATH Open document ID: 0848.90058
DOI: 10.1016/0166-218X(95)00032-M
author: Jacques Carlier
author: C. Lucet
published in: Discrete Applied Mathematics
publication date: 1996-10-24T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 897377
zbMATH Keywords: network reliability
zbMATH Keywords: \(K\)-terminal reliability
zbMATH Keywords: undirected networks
zbMATH Keywords: decomposition
zbMATH Keywords: boundary sets
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Computing the Reliability of Complex Networks
cites work: Network reliability and the factoring theorem
cites work: A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
cites work: Dividing a Graph into Triconnected Components
cites work: Factoring and reductions for networks with imperfect vertices
cites work: Triconnected decomposition for computingK-terminal network reliability
full work available at URL: 0166-218x(95)00032-m
OpenAlex ID: W2074342195
Recommended article: On Reliability Evaluation by Network Decomposition
Recommended article: An approach to the assessment of reliability of networks
Recommended article: A novel algorithm on network reliability estimation
Recommended article: An Algorithm for Network Reliability Bounds
Recommended article: A simple algorithm for computing network reliability
Recommended article: Q3768661
Recommended article: Implementation of a factoring algorithm for reliability evaluation of undirected networks
Recommended article: An efficient algorithm for computing global reliability of a network
Recommended article: On a kind of reliability analysis of networks
description: scientific article; zbMATH DE number 897377