A Theorem Concerning Cyclic Directed Graphs with Applications to Network Reliability.

Abstract

In a recent paper, Satyanarayana and Prabhaker have presented a new topological formula for evaluating exact reliability of terminal-pair directed networks. Terms in the formula are associated in a one-to-one fashion with certain acyclic subgraphs of the network, cyclic subgraphs being of no importance. In their paper, however, the proof that cyclic subgraphs may be ignored seems to be incomplete. We consider an alternate proof of this fact. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1978
Accession Number
ADA071440

Entities

People

  • Randall R. Willie

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • California
  • Continents
  • Contracts
  • Engineering
  • Flow Network
  • Geographic Regions
  • Graphs
  • Industrial Engineering
  • Military Research
  • New Jersey
  • North America
  • Operations Research
  • Reliability
  • Security
  • United States
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.