Cutting numbers for the forward loop backward hop network
type: Item
instance of: scholarly article
title: Cutting numbers for the forward loop backward hop network
zbMATH Open document ID: 0795.90027
DOI: 10.1016/0166-218X(92)00123-4
author: Frank K. Hwang
author: Xiaodong Hu
published in: Discrete Applied Mathematics
publication date: 1994-09-04T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 513344
zbMATH Keywords: network reliability
zbMATH Keywords: cutting number
zbMATH Keywords: faulty nodes
zbMATH Keywords: triple-node failures
MaRDI profile type: Publication
cites work: Q3798673
cites work: Q3819102
cites work: On the nonexistence of uniformly optimal graphs for pair-connected reliability
cites work: The expected number of pairs of connected nodes: Pair-connected reliability
cites work: Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
cites work: Network Resilience
cites work: Analysis and synthesis problems for network resilience
cites work: The cutting center theorem for trees
cites work: A linear algorithm for the cutting center of a tree
cites work: Reliabilities of Double-Loop Networks
cites work: Double loop networks with minimum delay
cites work: Q4206399
cites work: Resilience of partialk-tree networks with edge and node failures
cites work: Network reliability analysis: Part I
full work available at URL: 0166-218x(92)00123-4
OpenAlex ID: W2036900299
description: scientific article; zbMATH DE number 513344