Answers are grounded in this paper and cite their sources.
Algorithmic study demonstrates efficient simultaneous generation of minimal cutsets in directed graphs, highlighting the performance impact of specialized data structures.
Several approaches for evaluating network reliability require the generation of all minimal cutsets in a directed graph. A general iterative algorithm, based on an underlying algebraic structure, is proposed for generating all minimal s−j cutsets simultancously for all vertices j in such a graph. In order to implement this algorithm in an efficient manner and to exploit sparsity present in the graph, a number of computational simplifications are developed, leading to improved performance of the algorithm. Empirical results show that the choice of certain data structures can have a profound effect on the computational effort required.
No takes yet. Share an insight, caveat, or question.
Shier et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: