Full complexity analysis of the diameter-constrained reliability
- 27 March 2015
- journal article
- Published by Wiley in International Transactions in Operational Research
- Vol. 22 (5) , 811-821
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of computing the 2-K-reliability in networksInformation Processing Letters, 2014
- On computing the 2-diameter -constrainedK-reliability of networksInternational Transactions in Operational Research, 2012
- Reliability of communication networks with delay constraints: computational complexity and complete topologiesInternational Journal of Mathematics and Mathematical Sciences, 2004
- Reliability Issues In Telecommunications Network Planning1999
- Minimum-weight two-connected spanning networksMathematical Programming, 1990
- Computational Complexity of Network Reliability Analysis: An OverviewIEEE Transactions on Reliability, 1986
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Computing the Reliability of Complex NetworksSIAM Journal on Applied Mathematics, 1977
- Reducibility among Combinatorial Problems1972