The expected number of pairs of connected nodes: Pair-connected reliability
type: Item
instance of: scholarly article
title: The expected number of pairs of connected nodes: Pair-connected reliability
zbMATH Open document ID: 0800.68631
DOI: 10.1016/0895-7177(93)90245-T
published in: Mathematical and Computer Modelling
publication date: 1994-12-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 475032
zbMATH Keywords: reliability
zbMATH Keywords: survivability
zbMATH Keywords: communication networks
zbMATH Keywords: connectivity
zbMATH Keywords: pair- connected reliability
zbMATH Keywords: probabilistic graph
author: Ashok T. Amin
author: Kyle T. Siegrist
author: Peter Slater
MaRDI profile type: Publication
cites work: On unreliability polynomials and graph connectivity in reliable network synthesis
cites work: Computational Complexity of Network Reliability Analysis: An Overview
cites work: Synthesis of reliable networks - a survey
cites work: Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
cites work: Efficient algorithms for reliability analysis of planar networks - a survey
cites work: Factoring Algorithms for Computing K-Terminal Network Reliability
cites work: The cutting center theorem for trees
cites work: Network reliability analysis: Part I
cites work: A linear algorithm for the cutting center of a tree
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Q4083484
cites work: Q5585020
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Q3819102
cites work: On the nonexistence of uniformly optimal graphs for pair-connected reliability
full work available at URL: 0895-7177(93)90245-t
OpenAlex ID: W2072634584
description: scientific article; zbMATH DE number 475032