Cutset Analysis of Networks Using Basic Minimal Paths and Network Decomposition

DOI10.1109/TR.1985.5222169MaRDI QIDQ3686409zbMATHFDO

Authors G. B. Jasmon

Publication date 1985

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

zbMATH Keywords

network decompositionbasic minimal pathslink cutsetsnode cutsets

Mathematics Subject Classification ID

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

Recommendations

• A New Technique in Minimal Path and Cutset Evaluation
• A simple algorithm to search for all minimal cutsets with unreliable nodes
• scientific article; zbMATH DE number 857424
• scientific article; zbMATH DE number 1839614
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets

Cited in

(4)

• Minimal graph cuts on network subgraphs
• scientific article; zbMATH DE number 1839614 (Why is no real title available?)
• Mimicking Networks and Succinct Representations of Terminal Cuts
• A simple algorithm to search for all MCs in networks

This page was built for publication: Cutset Analysis of Networks Using Basic Minimal Paths and Network Decomposition

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