Which is the most reliable graph with n nodes and m edges? This celebrated problem has
several aspects, according to the notion of optimality (in a local or uniform sense), failure …

In this paper, we present a novel three-stage reduction-based estimation and optimization
heuristics to evaluate and improve large-scale road networks' reliability efficiently. Some …

The research community's attention has been attracted to the reliability of networks exposed
to large-scale disasters and this has become a critical concern in network studies during the …

With the increasing complexity and frequency of interactions among a large number of
heterogeneous nodes within a combat system of systems (SoS), evaluating the capability of …

The zeros of the reliability polynomials of circular consecutive-k-out-of-n: F systems are
studied. We prove that, for any fixed k≥ 2, the set of the roots of all the reliability polynomials …

Fast Methods for Ranking Synthetic BECs Page 1 Fast Methods for Ranking Synthetic BECs
Hsin-Po Wang University of California, Berkeley, CA, USA simple@berkeley.edu Vlad-Florin …

In this paper, we develop a new method for evaluating the reliability polynomial of a
hammock network. The method is based on a homogeneous absorbing Markov chain and …

In this paper we assume that a network is a probabilistic graph where the vertices do not fail
while the edges do, being operational independently with probability p. The two most …

In this article, we show a limit result for the reliability function of a system—that is, the
probability that the whole system is still operational after a certain given time—when the …

Consecutive--out-of-: F systems are one of the most well-studied types of networks when
discussing reliability. They have been used from safety–critical environments, such as …