Simple enumeration of minimal cutsets of acyclic directed graph

DOI10.1109/24.9868MaRDI QIDQ3815836zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A New Technique in Minimal Path and Cutset Evaluation
• scientific article; zbMATH DE number 1234600
• Iterative algorithms for generating minimal cutsets in directed graphs
• scientific article; zbMATH DE number 857424
• Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs

Cited in

(6)

• Parametric max flow problems in a class of networks with series-parallel structure
• A simple algorithm to search for all MCs in networks
• scientific article; zbMATH DE number 5131681 (Why is no real title available?)
• scientific article; zbMATH DE number 3987305 (Why is no real title available?)
• Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
• scientific article; zbMATH DE number 1234600 (Why is no real title available?)

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

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