Answers are grounded in this paper and cite their sources.
An algorithm (INMIN) derives the path sets of 2-state systems from their cut sets and vice versa. This algorithm is extended to invert min paths and min cuts using the monotonicity of s-coherent systems. The handling of sets for these algorithms can easily be programmed in PASCAL using the SET-concept of this language. The main goal of this approach is clarity and ease of programming, rather than high speed of computation. Details, programming facilities, source programs in PASCAL, and other material not in this paper are available in a separate report.
No takes yet. Share an insight, caveat, or question.
Klaus Heidtmann (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: