Resilience of partialk-tree networks with edge and node failures

DOI10.1002/net.3230210305zbMath0738.90029OpenAlexW2077445051MaRDI QIDQ3971579

Erick Mata-Montero

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210305

zbMATH Keywords

graphcommunication networksresilience\(k\)-cliquecomputing aspects of reliabilitypartial \(k\)-tree network

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Network reliability: Heading out on the highway ⋮ Cutting numbers for the forward loop backward hop network

This page was built for publication: Resilience of partialk-tree networks with edge and node failures