scientific article; zbMATH DE number 1490110

MaRDI QIDQ4496339zbMATH OpenFDO

Authors T. Koide, S. Shinmori, Hiroaki Ishii

Publication date 21 May 2001

zbMATH Keywords

all-terminal reliabilityboundspolynomial-time algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A note on bounding \(k\)-terminal reliability
• scientific article; zbMATH DE number 7375995
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
• scientific article; zbMATH DE number 4019092
• scientific article; zbMATH DE number 1263176
• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• scientific article; zbMATH DE number 4045783

Cited in

(6)

• Practical sequential bounds for approximating two-terminal reliability
• A novel algorithm on network reliability estimation
• An Algorithm for Network Reliability Bounds
• Tight bounds for popping algorithms
• Network transformations and bounding network reliability
• A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

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