Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph

DOI10.1109/TR.1979.5220473zbMath0397.05031MaRDI QIDQ4180383

No author found.

Publication date: 1979

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

zbMATH Keywords

All Minimal Cut-Sets for a Node Pair in a GraphConnected SubgraphsEnumeration Algorithm

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99) Connectivity (05C40) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Parametric max flow problems in a class of networks with series-parallel structure ⋮ Fast computation of bounds for two-terminal network reliability ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems ⋮ A simple algorithm to search for all MCs in networks ⋮ MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components

This page was built for publication: Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph