Geodesic
Reliability of binary systems
Diskretnaya Matematika, Tome 11 (1999) no. 1, pp. 129-139 
A. A. Chernyak; Zh. A. Chernyak. Reliability of binary systems. Diskretnaya Matematika, Tome 11 (1999) no. 1, pp. 129-139. http://geodesic.mathdoc.fr/item/DM_1999_11_1_a8/
@article{DM_1999_11_1_a8,
     author = {A. A. Chernyak and Zh. A. Chernyak},
     title = {Reliability of binary systems},
     journal = {Diskretnaya Matematika},
     pages = {129--139},
     year = {1999},
     volume = {11},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_1_a8/}
}
TY  - JOUR
AU  - A. A. Chernyak
AU  - Zh. A. Chernyak
TI  - Reliability of binary systems
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 129
EP  - 139
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_1_a8/
LA  - ru
ID  - DM_1999_11_1_a8
ER  - 
%0 Journal Article
%A A. A. Chernyak
%A Zh. A. Chernyak
%T Reliability of binary systems
%J Diskretnaya Matematika
%D 1999
%P 129-139
%V 11
%N 1
%U http://geodesic.mathdoc.fr/item/DM_1999_11_1_a8/
%G ru
%F DM_1999_11_1_a8

Voir la notice de l'article provenant de la source Math-Net.Ru

The main result of the paper is a theorem characterizing the combinatorial structure of pathsets and cutsets of regular binary systems. As direct corollaries of the theorem the following results are presented: efficient algorithms for computing the reliability and determining all minimal cutsets of regular and uniform regular systems are given; a constructive characterization of regular systems having a matroidal structure is suggested; efficiently computable lower bounds for the reliability of uniform systems, which are provided by regular systems, are obtained.