Simple enumeration of minimal cutsets of acyclic directed graph

DOI10.1109/24.9868zbMath0664.90030OpenAlexW2105526865MaRDI QIDQ3815836

S. Hasanuddin Ahmad

Publication date: 1988

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

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

zbMATH Keywords

acyclic directed graphcutsetsreliability of networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (2)

Parametric max flow problems in a class of networks with series-parallel structure ⋮ A simple algorithm to search for all MCs in networks

This page was built for publication: Simple enumeration of minimal cutsets of acyclic directed graph