Accession Number:

ADA112699

Title:

Set Theoretic Signed Domination for Coherent Systems.

Descriptive Note:

Research rept.,

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1982-02-01

Pagination or Media Count:

20.0

Abstract:

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

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE