scientific article; zbMATH DE number 975420

zbMATH Open0861.90060MaRDI QIDQ5284097FDOQ5284097

L. D. Nel, Fan Zhang

Publication date: 4 February 1997

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

Recommendations

• scientific article; zbMATH DE number 205333
• Bounding network-reliability using consecutive minimal cutsets
• scientific article; zbMATH DE number 1154601
• Counting almost minimum cutsets with reliability applications
• Edge-packings of graphs and network reliability
• Improved bounds and algorithms for graph cuts and network reliability
• Improved bounds and algorithms for graph cuts and network reliability
• scientific article; zbMATH DE number 26483
• On packing \(T\)-cuts
• Enhancing the consecutive cuts bound for network reliability

zbMATH Keywords

probabilistic graphcutset selection strategiesminimum cost cutsettwo-terminal reliability of a network

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Edge-packings of graphs and network reliability

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 Q5284097)