|
This article is cited in 2 scientific papers (total in 2 papers)
Reliability of binary systems
A. A. Chernyak, Zh. A. Chernyak
Abstract:
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.
Received: 20.12.1996 Revised: 28.01.1998
Citation:
A. A. Chernyak, Zh. A. Chernyak, “Reliability of binary systems”, Diskr. Mat., 11:1 (1999), 129–139; Discrete Math. Appl., 9:1 (1999), 101–112
Linking options:
https://www.mathnet.ru/eng/dm360https://doi.org/10.4213/dm360 https://www.mathnet.ru/eng/dm/v11/i1/p129
|
Statistics & downloads: |
Abstract page: | 366 | Full-text PDF : | 189 | First page: | 2 |
|