Abstract
The authors argue that the network decomposition suggested by Jasmon (1985) fails to give all basic minimal paths of the network, depending on the number of nodes split. Consequently, some minimal node cut sets are not generated. Even those generated using these basic minimal paths need not be minimal node cut sets. >
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.
