Full complexity analysis of the diameter-constrained reliability

DOI10.1111/ITOR.12159MaRDI QIDQ2806430zbMATH OpenOpenAlexFDO

Authors Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor

Publication date 18 May 2016

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12159

zbMATH Keywords

computational complexitynetwork reliabilitydiameter-constrained reliabilityMonma graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
• Diameter constrained reliability of ladders and Spanish fans
• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Reliability of communication networks with delay constraints: computational complexity and complete topologies
• The complexity of computing the 2-K-reliability in networks

Cites work

• scientific article; zbMATH DE number 1735793 (Why is no real title available?)
• Computational Complexity of Network Reliability Analysis: An Overview
• Computing the Reliability of Complex Networks
• Minimum-weight two-connected spanning networks
• On computing the 2-diameter-constrained \(K\)-reliability of networks
• 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
• The Complexity of Enumeration and Reliability Problems
• The complexity of computing the 2-K-reliability in networks

Cited in

(11)

• Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
• Diameter constrained reliability of ladders and Spanish fans
• The complexity of computing the 2-K-reliability in networks
• On the reliability estimation of stochastic binary systems
• Reliability of communication networks with delay constraints: computational complexity and complete topologies
• scientific article; zbMATH DE number 1735793 (Why is no real title available?)
• Factorization and exact evaluation of the source-terminal diameter-constrained reliability
• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Sixty years of network reliability
• A parallel method for reliability calculation of diameter constrained networks
• On the characterization of the domination of a diameter-constrained network reliability model

This page was built for publication: Full complexity analysis of the diameter-constrained reliability

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