At present “the theory of bounds for network reliability” is absorbed by a more wide theory of network reliability (in one’s turn, by a theory of reliability). It is not an independent subject. In spite of monographs on reliability theory (see, for example, [1,2,3,4]) pay some attention to bounds of network reliability, it is difficult to realize the subject clearly. Nobody describes it systematically. Moreover, the subject was never a whole object for independent investigation. Of course, presentations there exist (see, for example, [4]). Recently we made an attempt to give [5] a general look on the subject. Here are its essential features
Traditionally, game theoretic approaches to measuring transport network reliability have relied on t...
Abstract not reproduced here by request of the publisher. The text is available from: http://dx.doi....
AbstractThe (all-terminal) reliability of a graph G is the probability that all vertices are in the ...
A difficulty with network reliability algorithms is failure to complete on problems of practical siz...
I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to...
In this letter, we examine how the reliability of a telecommunication network depends on the redunda...
In this letter, we examine how the reliability of a telecommunication network depends on the redunda...
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probabil...
A survey of the subject of network reliability is presented. Network reliability is the study of net...
In classical network reliability analysis, the system under study is a net-work with perfect nodes b...
This paper provides a detailed review of the state of the art in the field of network reliability an...
The modern society has become dependent on different communication and information networks. The tec...
The modern society has become dependent on different communication and information networks. The tec...
Consider a communication network with a set of sites and a set of links between them. Suppose that t...
Consider a communication network with a set of sites and a set of links between them. Suppose that t...
Traditionally, game theoretic approaches to measuring transport network reliability have relied on t...
Abstract not reproduced here by request of the publisher. The text is available from: http://dx.doi....
AbstractThe (all-terminal) reliability of a graph G is the probability that all vertices are in the ...
A difficulty with network reliability algorithms is failure to complete on problems of practical siz...
I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to...
In this letter, we examine how the reliability of a telecommunication network depends on the redunda...
In this letter, we examine how the reliability of a telecommunication network depends on the redunda...
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probabil...
A survey of the subject of network reliability is presented. Network reliability is the study of net...
In classical network reliability analysis, the system under study is a net-work with perfect nodes b...
This paper provides a detailed review of the state of the art in the field of network reliability an...
The modern society has become dependent on different communication and information networks. The tec...
The modern society has become dependent on different communication and information networks. The tec...
Consider a communication network with a set of sites and a set of links between them. Suppose that t...
Consider a communication network with a set of sites and a set of links between them. Suppose that t...
Traditionally, game theoretic approaches to measuring transport network reliability have relied on t...
Abstract not reproduced here by request of the publisher. The text is available from: http://dx.doi....
AbstractThe (all-terminal) reliability of a graph G is the probability that all vertices are in the ...