Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
From MaRDI portal
Publication:3735418
DOI10.1109/TR.1986.4335425zbMath0599.90041MaRDI QIDQ3735418
Brent N. Clark, Charles J. Colbourn, Eric Neufeld
Publication date: 1986
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
network reliability; all-terminal reliability; probabilistic graph; maximum mean number of communicating vertex pairs; most reliable network; series-parallel undirected networks
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
The optimal unicyclic graphs for pair-connected reliability, The expected number of pairs of connected nodes: Pair-connected reliability, Analysis and synthesis problems for network resilience, Cutting numbers for the forward loop backward hop network, The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees, Network Resilience