Factorization and exact evaluation of the source-terminal diameter-constrained reliability

DOI10.1002/NET.21780MaRDI QIDQ6496357zbMATH OpenFDO

Authors Eduardo A. Canale, Pablo Romero, Gerardo Rubino

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.21780

zbMATH Keywords

composition graphscomputational complexitydiameter-constrained reliabilityfactorization theorynetwork reliabilityseries-parallel graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Full complexity analysis of the diameter-constrained reliability
• Reliability of communication networks with delay constraints: computational complexity and complete topologies
• scientific article; zbMATH DE number 1735793
• A parallel method for reliability calculation of diameter constrained networks

Cites work

• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A quick method for finding shortest pairs of disjoint paths
• A survey of efficient reliability computation using disjoint products approach
• Computational Complexity of Network Reliability Analysis: An Overview
• Computing diameter constrained reliability of a network with junction points
• Computing the Reliability of Complex Networks
• Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
• Disjoint paths in a network
• Elements of Information Theory
• Full complexity analysis of the diameter-constrained reliability
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 1735793 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Network reliability and the factoring theorem
• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Reducibility among combinatorial problems
• Reliability of communication networks with delay constraints: computational complexity and complete topologies
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

This page was built for publication: Factorization and exact evaluation of the source-terminal diameter-constrained reliability

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