Efficient Computation of the K-Terminal Reliability of Directed Acyclic Networks.

Abstract

This thesis describes several topological reduction and decomposition techniques developed to decrease the complexity of computing K-terminal reliability of an acyclic directed network with independent component failures. A program using these techniques has been coded in FORTRAN and tested on complete acyclic graphs and street networks with up to 100 vertices.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1983
Accession Number
ADA136900

Entities

People

  • L. Chan

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computational Complexity
  • Computations
  • Computer Networks
  • Computer Programming
  • Computer Programs
  • Computers
  • Decomposition
  • Language
  • Lists (Data Structures)
  • Network Science
  • Networks
  • Notation
  • Operations Research
  • Reliability
  • Terminals

Readers

  • Computer Vision.
  • Parallel and Distributed Computing.