Computing optimal assignments for residual network reliability
type: Item
instance of: scholarly article
title: Computing optimal assignments for residual network reliability
zbMATH Open document ID: 0878.68021
DOI: 10.1016/S0166-218X(97)89164-0
author: C. Stivaros
author: K. Sutner
published in: Discrete Applied Mathematics
publication date: 1997-12-17T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 1047192
zbMATH Keywords: reliability
zbMATH Keywords: complete bipartite graphs
MaRDI profile type: Publication
cites work: Complexity of network reliability computations
cites work: Computing residual connectedness reliability for restricted networks
cites work: Algorithms for K-terminal reliability problems with node failures
cites work: Q4198056
cites work: Q3328583
cites work: Optimal Consecutive-2-out-of-n:F Component Sequencing
cites work: Q4298260
cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs
cites work: A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
cites work: Q4293112
cites work: Q3139535
cites work: Q4028263
cites work: The Complexity of the Residual Node Connectedness Reliability Problem
cites work: The Complexity of Enumeration and Reliability Problems
Wikidata QID: Q128037141
description: scientific article; zbMATH DE number 1047192