Title: An efficient algorithm for computing the signatures of networks
Authors: Gaofeng Da - Nanjing University of Aeronautics and Astronautics (China) [presenting]
Maochao Xu - Illinois State University (United States)
Ping Shing Ben Chan - The Chinese University of Hong Kong (Hong Kong)
Abstract: Computing the network signature has been an attractive but challenging problem in network reliability. We propose a novel algorithm to compute the signature of a network. This new algorithm relies only on the information of minimal cuts sets or minimal path sets, which is very intuitive and efficient. The new results are used to address the problem of the ageing property of the signature in literature. We further discuss the bounds for the signature when only partial information is available. The application of these new results to cyberattacks is also highlighted.