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

DOI10.1002/NET.21780MaRDI QIDQ6496357

Gerardo Rubino, Pablo Romero, Eduardo A. Canale

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexityseries-parallel graphsnetwork reliabilityfactorization theorycomposition graphsdiameter-constrained reliability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing diameter constrained reliability of a network with junction points
• Reliability of communication networks with delay constraints: computational complexity and complete topologies
• Full complexity analysis of the diameter-constrained reliability
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• A quick method for finding shortest pairs of disjoint paths
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Computational Complexity of Network Reliability Analysis: An Overview
• Disjoint paths in a network
• Computing the Reliability of Complex Networks
• Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
• Network reliability and the factoring theorem
• A survey of efficient reliability computation using disjoint products approach
• On computing the 2‐diameter ‐constrained K ‐reliability of networks
• Reducibility among Combinatorial Problems
• Elements of Information Theory

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