A Method for Evaluating All the Minimal Cuts of a Graph

DOI10.1109/TR.1987.5222466MaRDI QIDQ3775312zbMATH OpenOpenAlexFDO

Authors G. B. Jasmon, K. W. C. Foong

Publication date 1987

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

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

zbMATH Keywords

minimal cutsN-sink node networknon-planar networkrandom graphs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of mathematical programming (90C90)

Recommendations

• A New Technique in Minimal Path and Cutset Evaluation
• A simple algorithm to search for all minimal cutsets with unreliable nodes
• Minimal Cuts up to Third Order in a Planar Graph
• Iterative algorithms for generating minimal cutsets in directed graphs
• scientific article; zbMATH DE number 1234600

Cited in

(4)

• A simple algorithm to search for all MCs in networks
• A simple algorithm to search for all minimal cutsets with unreliable nodes
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• Minimal Cuts up to Third Order in a Planar Graph

This page was built for publication: A Method for Evaluating All the Minimal Cuts of a Graph

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