Consecutive cuts and paths, and bounds on k‐terminal reliability

DOI10.1002/NET.3230250309MaRDI QIDQ4838205zbMATH OpenOpenAlexFDO

Authors Heidi J. Strayer, Charles J. Colbourn

Publication date 20 July 1995

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230250309

zbMATH Keywords

\(k\)-terminal lower boundconsecutive pathsetsinterval graph with imperfect verticestwo-terminal reliability

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Bounding network-reliability using consecutive minimal cutsets
• scientific article; zbMATH DE number 1154601
• Enhancing the consecutive cuts bound for network reliability

Cites work

• An Algorithm for Network Reliability Bounds
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• Incidence matrices and interval graphs
• Series-Parallel Bounds for the Two-Terminal Reliability Problem

Cited in

(4)

• Enhancing the consecutive cuts bound for network reliability
• Bounding network-reliability using consecutive minimal cutsets
• scientific article; zbMATH DE number 1154601 (Why is no real title available?)
• Network reliability: Heading out on the highway

This page was built for publication: Consecutive cuts and paths, and bounds on k‐terminal reliability

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