Geodesic
Structure-complex systems with threshold survival
Diskretnaya Matematika, Tome 11 (1999) no. 4, pp. 65-78 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Earlier there was obtained a characterization of complex systems modeled by $K$-terminal undirected networks with threshold survival. The characterization of complex systems modelled by $K$-terminal directed networks with threshold survival was an open problem. The solution of this problem directly follows from the characterization of $dc$-trivial graphs with threshold survival given in the paper. The $dc$-trivial graphs form a subset of monotone graphs and include as special cases all classic multiterminal reliability networks. The general class of monotone graphs is proved to be recognized in time polynomial in the number of their minpaths. 
@article{DM_1999_11_4_a5,
     author = {A. A. Chernyak},
     title = {Structure-complex systems with threshold survival},
     journal = {Diskretnaya Matematika},
     pages = {65--78},
     year = {1999},
     volume = {11},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_4_a5/}
}
TY  - JOUR
AU  - A. A. Chernyak
TI  - Structure-complex systems with threshold survival
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 65
EP  - 78
VL  - 11
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_4_a5/
LA  - ru
ID  - DM_1999_11_4_a5
ER  - 
%0 Journal Article
%A A. A. Chernyak
%T Structure-complex systems with threshold survival
%J Diskretnaya Matematika
%D 1999
%P 65-78
%V 11
%N 4
%U http://geodesic.mathdoc.fr/item/DM_1999_11_4_a5/
%G ru
%F DM_1999_11_4_a5
A. A. Chernyak. Structure-complex systems with threshold survival. Diskretnaya Matematika, Tome 11 (1999) no. 4, pp. 65-78. http://geodesic.mathdoc.fr/item/DM_1999_11_4_a5/