Cutting numbers for the forward loop backward hop network

DOI10.1016/0166-218X(92)00123-4zbMath0795.90027OpenAlexW2036900299MaRDI QIDQ1315462

Frank K. Hwang, Xiao-Dong Hu

Publication date: 4 September 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)00123-4

zbMATH Keywords

network reliabilitycutting numberfaulty nodestriple-node failures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for the cutting center of a tree
• The expected number of pairs of connected nodes: Pair-connected reliability
• Analysis and synthesis problems for network resilience
• Double loop networks with minimum delay
• The cutting center theorem for trees
• Reliabilities of Double-Loop Networks
• Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
• Network Resilience
• Resilience of partialk-tree networks with edge and node failures
• On the nonexistence of uniformly optimal graphs for pair-connected reliability
• Network reliability analysis: Part I

This page was built for publication: Cutting numbers for the forward loop backward hop network