Efficient methods for computing the reliability polynomials of graphs and complex networks
Various methods have been proposed to evaluate the reliability of a graph, one of the most
well known of which is the reliability polynomial, R (G, p). It is assumed that G (V, E) is a …
well known of which is the reliability polynomial, R (G, p). It is assumed that G (V, E) is a …
Using the network reliability polynomial to characterize and design networks
We consider methods for solving certain network characterization and design problems that
arise in network epidemiology. We argue that the network reliability polynomial introduced …
arise in network epidemiology. We argue that the network reliability polynomial introduced …
Beyond Binary: Dependability Analysis of Gates using Reliability Polynomials of Minimal Hammock Networks
Moore and Shannon introduced a probabilistic model in which network nodes are assumed
to be completely reliable, and communication links or edges can fail with a given probability …
to be completely reliable, and communication links or edges can fail with a given probability …
[PDF][PDF] Counting connected subgraphs
R Verhaegh - pure.tue.nl
In this report we research two counting problems in graphs of bounded degree. In the first
part we focus on counting the number of connected induced subgraphs of a graph G …
part we focus on counting the number of connected induced subgraphs of a graph G …
[图书][B] Application of group testing for analyzing noisy networks
V Ufimtsev - 2016 - search.proquest.com
My dissertation focuses on developing scalable algorithms for analyzing large complex
networks and evaluating how the results alter with changes to the network. Network analysis …
networks and evaluating how the results alter with changes to the network. Network analysis …