Abstract
This paper presents a technique for the enumeration of minimal paths of two-terminal networks. The method is developed based on the multiway tree structure that has been used widely for sorting and searching. The new technique does not require any matrix multiplication; it only requires a connection matrix. Furthermore, this simple method has capability of evaluating the reliability of a network after a topological modification, without going through the entire evaluation process. The method is compared with the existing algorithms, and the application simplicity of this method is demonstrated through examples.
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 callMore From: International Journal of Reliability, Quality and Safety Engineering
Disclaimer: 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.
