Computing optimal assignments for residual network reliability

DOI10.1016/S0166-218X(97)89164-0zbMath0878.68021WikidataQ128037141 ScholiaQ128037141MaRDI QIDQ1363776

C. Stivaros, Klaus Sutner

Publication date: 17 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

reliabilitycomplete bipartite graphs

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

The enumeration of vertex induced subgraphs with respect to the number of components ⋮ The intractability of the reliable assignment problem in split networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing residual connectedness reliability for restricted networks
• The Complexity of the Residual Node Connectedness Reliability Problem
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Optimal Consecutive-2-out-of-n:F Component Sequencing
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• The Complexity of Enumeration and Reliability Problems
• Complexity of network reliability computations
• Algorithms for K-terminal reliability problems with node failures

This page was built for publication: Computing optimal assignments for residual network reliability