Some Results on the Overall Reliability of Undirected Graphs.

Abstract

A probabilistic graph consists of vertices and links that fail with some known probabilities. For such a graph, overall reliability is the probability that there exists communication between all vertex-pairs. In this paper, some useful results are presented to simplify the overall reliability computation of an undirected graph when the failure events of the links are statistically independent. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1981
Accession Number
ADA097445

Entities

People

  • A. Satyanarayana
  • Mark K. Chang
  • Zohel S. Khalil

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computational Complexity
  • Computations
  • Decomposition
  • Electrical Networks
  • Engineering
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • Operations Research
  • Probability
  • Reliability
  • United States
  • United States Government

Fields of Study

  • Engineering

Readers

  • Graph Algorithms and Convex Optimization.
  • Regression Analysis.