A New Technique in Minimal Path and Cutset Evaluation
From MaRDI portal
Publication:3690764
DOI10.1109/TR.1985.5221974zbMath0572.94024MaRDI QIDQ3690764
Publication date: 1985
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
minimal pathsreliabilityenumerationcomputer implementationminimal cutsetsfailuresundirected networkFortran computer program
Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items (3)
Parametric max flow problems in a class of networks with series-parallel structure ⋮ A simple algorithm to search for all MCs in networks ⋮ Algorithms for the determination of cutsets in a hypergraph
This page was built for publication: A New Technique in Minimal Path and Cutset Evaluation