Full complexity analysis of the diameter-constrained reliability
Year of publication: |
September 2015
|
---|---|
Authors: | Canale, Eduardo ; Cancela, Héctor ; Robledo, Franco ; Romero, Pablo ; Sartor, Pablo |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 22.2015, 5, p. 811-821
|
Subject: | network reliability | computational complexity | diameter-constrained reliability | Monma graphs | Graphentheorie | Graph theory | Komplexitätsmanagement | Complexity management | Komplexe Systeme | Complex systems |
-
Grouping interdependent tasks : using spectral graph partitioning to study complex systems
Lee, Chi-Hyon, (2016)
-
The critical complexity of graph properties
Turán, György, (1983)
-
Extension complexity of the correlation polytope
Aboulker, Pierre, (2019)
- More ...
-
On computing the 2-diameter-constrained K-reliability of networks
Canale, Eduardo, (2013)
-
On the reliability estimation of stochastic binary systems
Cancela, Héctor, (2021)
-
On the reliability estimation of stochastic binary systems
Cancela, Héctor, (2022)
- More ...