Cut-Set Intersections and Node Partitions

DOI10.1109/TR.1984.5221875MaRDI QIDQ3718465zbMATH OpenOpenAlexFDO

Authors John A. Buzacott, Jack S. K. Chang

Publication date 1984

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1984.5221875

zbMATH Keywords

cut set of a graphcut-set inclusion and exclusionk-cell partition of the nodesnetwork reliability measuresreliability in complete graphs

Mathematics Subject Classification ID

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

Recommendations

• Node partition formula for directed graph reliability
• Partitions and network reliability
• Counting almost minimum cutsets with reliability applications
• A New Technique in Minimal Path and Cutset Evaluation
• The Ordering of Terms in Cut-based Recursive Disjoint Products

Cited in

(6)

• Fault-tolerance analysis of multibus multiprocessor system
• Partitions and network reliability
• Split closure and intersection cuts
• The Ordering of Terms in Cut-based Recursive Disjoint Products
• scientific article; zbMATH DE number 2086918 (Why is no real title available?)
• Algorithms for the determination of cutsets in a hypergraph

This page was built for publication: Cut-Set Intersections and Node Partitions

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