A SURVEY OF NETWORK RELIABILITY AND DOMINATION THEORY

The author present a brief survey of the current state of the art in network reliability. General methods are reviewed for network reliability computation and discuss the central role played by domination theory in network reliability computational complexity. The authors point out the connection with the more general problem of computing the reliability of coherent structures. The class of coherent structures contains both directed and undirected networks as well as logic (or fault) trees without not gates.