Accession Number:

ADA071440

Title:

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

Descriptive Note:

Research rept.,

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1978-12-01

Pagination or Media Count:

18.0

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

Subject Categories:

  • Statistics and Probability
  • Manufacturing and Industrial Engineering and Control of Production Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE