Full complexity analysis of the diameter-constrained reliability
From MaRDI portal
Publication:2806430
DOI10.1111/itor.12159zbMath1338.90425OpenAlexW2156583013MaRDI QIDQ2806430
Pablo Sartor, Eduardo A. Canale, Pablo Romero, Héctor Cancela, Franco Robledo
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
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (2)
Cites Work
- Unnamed Item
- Minimum-weight two-connected spanning networks
- Reliability of communication networks with delay constraints: computational complexity and complete topologies
- The complexity of computing the 2-K-reliability in networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Computational Complexity of Network Reliability Analysis: An Overview
- The Complexity of Enumeration and Reliability Problems
- Computing the Reliability of Complex Networks
- On computing the 2‐diameter ‐constrained K ‐reliability of networks
This page was built for publication: Full complexity analysis of the diameter-constrained reliability