Set Theoretic Signed Domination for Coherent Systems.
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
A recent combinatorial result relevant to the computational complexity of undirected networks is extended to include all coherent structures. This set-theoretic result provides computational insight for the problem of computing k-out-of-n system reliability, for example. All results are illustrated via simple networks. Author
- Statistics and Probability