scientific article; zbMATH DE number 176250

zbMATH Open0766.05050MaRDI QIDQ4035356FDOQ4035356

Authors: F. T. Boesch, A. Satyanarayana, Charles L. Suffel 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1161336
• scientific article; zbMATH DE number 1145911
• The Complexity of the Residual Node Connectedness Reliability Problem
• scientific article; zbMATH DE number 139921
• scientific article; zbMATH DE number 867686

zbMATH Keywords

connectednessnetwork reliabilityindependent probabilities

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Cited In (9)

• Uniformly optimal graphs in some classes of graphs with node failures
• The Complexity of the Residual Node Connectedness Reliability Problem
• Title not available (Why is that?)
• Reliability-Equivalent-Replacement of a Subnetwork
• Residual reliability of P-threshold graphs
• The enumeration of vertex induced subgraphs with respect to the number of components
• Computing residual connectedness reliability for restricted networks
• Reliability analysis of networks using stochastic model
• On the synthesis of reliable probability networks

This page was built for publication:

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