A Way from Adjacency Matrix to Linked Path Structure  
Author Shin-Guang Chen




Abstract In investigating network problems, the method for ex- pressing network structure is important. Usually, the ad jacency matrix (AM) is employed. However, in the view points of computer science, AM is not the best choice for program implementation. In solving network reliability, the linked path structure (LPS) is now more and more popular in the literature. Thus, a tool for transforming AM to LPS is required. This paper proposes an easy way to do such transformation. Several examples are demonstrated. The results enrich the tool sets in solving network related applications.


Keywords Adjacency matrix, linked path structure, network reliability, minimal path, backtrack
    Article #:  RQD25-20
Proceedings of 25th ISSAT International Conference on Reliability & Quality in Design
August 1-3, 2019 - Las Vegas, NV, U.S.A.