Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
