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) : Barlow,Richard E

PDF Url : ADA112699

Report Date : Feb 1982

Pagination or Media Count : 20

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)

Descriptors :   *Networks, *Set theory, *Computations, Coherence, Reliability, Combinatorial analysis, Systems analysis, Probability, Algorithms

Subject Categories : Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE