Resilience of partialk-tree networks with edge and node failures

DOI10.1002/NET.3230210305MaRDI QIDQ3971579zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Publication:4206399
• Network Resilience
• Computing residual connectedness reliability for restricted networks
• An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks

Cited in

(5)

• Network reliability: Heading out on the highway
• Cutting numbers for the forward loop backward hop network
• scientific article; zbMATH DE number 4126698 (Why is no real title available?)
• Network Resilience
• Fixed-parameter tractability of treewidth and pathwidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971579)