Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
From MaRDI portal
Publication:3945967
DOI10.1109/TR.1982.5221285zbMath0485.90084MaRDI QIDQ3945967
No author found.
Publication date: 1982
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
algorithmundirected graphcomputer implementationblocking mechanismminimal cut-setsefficient enumeration algorithm
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (7)
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ On enumerating minimal dicuts and strongly connected subgraphs ⋮ A simple algorithm to search for all MCs in networks ⋮ MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components ⋮ Algorithms for the determination of cutsets in a hypergraph
This page was built for publication: Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
