Combinatorial Reliability and Repair

Abstract

During the Summers of 1991 and 1992 the principal investigator research the use of combinatorial techniques in analyzing problems involving the repair of K-terminal networks, which are networks given with a distinguished subset K of the vortex-set. (Ordinary graph theory can be viewed as being equivalent to the special case K=V(G).) There are large bodies of existing literature describing the uses of such techniques in analyzing (1) ordinary networks (for which the reliability and repair problems are very similar to each other, being connected with certain matroids associated to the network) and (2) K-terminal reliability problems; the fundamental problem is to find out how these two bodies of material generalize to the repair of K-terminal networks. The original proposal listed several specific areas of research, of which the second and fifth turned out to be the most interesting.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1992
Accession Number
ADA258003

Entities

People

  • Lorenzo Traldi

Organizations

  • Lafayette College

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Graph Theory
  • Literature
  • Materials
  • Mathematics
  • Polynomials
  • Reliability
  • Security
  • Terminals
  • Universities

Readers

  • Materials Science.
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design