Set Theoretic Signed Domination for Coherent Systems.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1982
Accession Number
ADA112699

Entities

People

  • Richard E. Barlow

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Classification
  • Computational Complexity
  • Decomposition
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • North Carolina
  • Operations Research
  • Probability
  • Reliability
  • Security
  • Set Theory
  • Terminals
  • Theorems

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design