The expected number of pairs of connected nodes: Pair-connected reliability

DOI10.1016/0895-7177(93)90245-TzbMath0800.68631MaRDI QIDQ1310221

Kyle T. Siegrist, Peter J. Slater, Ashok T. Amin

Publication date: 4 December 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90245-t

zbMATH Keywords

reliability; communication networks; connectivity; survivability; probabilistic graph; pair- connected reliability

Mathematics Subject Classification ID

90B18: Communication networks in operations research

68R10: Graph theory (including graph drawing) in computer science

90B25: Reliability, availability, maintenance, inspection in operations research

05C40: Connectivity

Related Items

On the roots of Wiener polynomials of graphs, The optimal unicyclic graphs for pair-connected reliability, Cutting numbers for the forward loop backward hop network, On roots of Wiener polynomials of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for the cutting center of a tree
• The cutting center theorem for trees
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
• Computational Complexity of Network Reliability Analysis: An Overview
• Factoring Algorithms for Computing K-Terminal Network Reliability
• Synthesis of reliable networks - a survey
• Efficient algorithms for reliability analysis of planar networks - a survey
• On the nonexistence of uniformly optimal graphs for pair-connected reliability
• Network reliability analysis: Part I
• Depth-First Search and Linear Graph Algorithms