Computing optimal assignments for residual network reliability

DOI10.1016/S0166-218X(97)89164-0zbMATH Open0878.68021WikidataQ128037141 ScholiaQ128037141MaRDI QIDQ1363776FDOQ1363776

C. Stivaros, K. 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

Recommendations

• The intractability of the reliable assignment problem in split networks
• Publication:4862892
• The Complexity of the Residual Node Connectedness Reliability Problem
• scientific article

zbMATH Keywords

reliabilitycomplete bipartite graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Reliability optimization of computer-communication networks
• Title not available (Why is that?)
• The enumeration of vertex induced subgraphs with respect to the number of components
• The intractability of the reliable assignment problem in split networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363776)