In this paper, an algorithm for the fast computation of network reliability bounds is proposed.
The evaluation of the network reliability is an intractable problem for very large networks …

This paper addresses an NP-hard problem to design a network topology with maximum all-
terminal reliability subject to a cost constraint, given the locations of the various computer …

Логико-вероятностный анализ и его история КОРЗИНА ПОИСК НАВИГАТОР СЕССИЯ
КОНТАКТЫ ИНФОРМАЦИЯ О ПУБЛИКАЦИИ eLIBRARY ID: 21774487 EDN: QMVXAK …

This dissertation aims to conduct a comprehensive and up to date review of reliability
bounds for the binary coherent systems. We assume that the components work …

In classical network reliability analysis, the system under study is a network with perfect
nodes but imperfect link, that fail stochastically and independently. There, the goal is to find …

Let $ G=(V, E) $ be a simple graph with $| V|= n $ nodes and $| E|= m $ links, a subset $
K\subseteq V $ of\emph {terminals}, a vector $ p=(p_1,..., p_m)\in [0, 1]^ m $ and a positive …