Geodesic
Using EDP-polynomials in Optimal Structures Choosing
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 1, pp. 3-14 
O. A. Gadyatskaya. Using EDP-polynomials in Optimal Structures Choosing. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 1, pp. 3-14. http://geodesic.mathdoc.fr/item/VNGU_2008_8_1_a0/
@article{VNGU_2008_8_1_a0,
     author = {O. A. Gadyatskaya},
     title = {Using {EDP-polynomials} in {Optimal} {Structures} {Choosing}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {3--14},
     year = {2008},
     volume = {8},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2008_8_1_a0/}
}
TY  - JOUR
AU  - O. A. Gadyatskaya
TI  - Using EDP-polynomials in Optimal Structures Choosing
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2008
SP  - 3
EP  - 14
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VNGU_2008_8_1_a0/
LA  - ru
ID  - VNGU_2008_8_1_a0
ER  - 
%0 Journal Article
%A O. A. Gadyatskaya
%T Using EDP-polynomials in Optimal Structures Choosing
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2008
%P 3-14
%V 8
%N 1
%U http://geodesic.mathdoc.fr/item/VNGU_2008_8_1_a0/
%G ru
%F VNGU_2008_8_1_a0

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

Using of random graph’s EDP-polynomials in choosing optimal with respect to minimum EDP criterion is observed. Here EDP is the expectation of a number of disconnected pairs of nodes. The vertices are assumed to be perfectly reliable, while the edges fail independently with the same probability. Examples of using EDP-polynomials both for the selection of optimal structures and for proving optimality of some structures in general case are presented.

[1] Gadyatskaya O. A., Rodionov A. S., “Issledovanie nekotorykh pokazatelei svyaznosti sluchainykh grafov”, Problemy funktsionirovaniya informatsionnykh setei, IX Mezhdunarodnaya konferentsiya, IVMiMG, Novosibirsk, 2006, 87–89

[2] Koide T., Shinmori S., Ishii H., “Topological Optimization with a Network Reliability Constraint”, Discrete Applied Mathematics, 115:1–3 (2001), 135–149 | MR | Zbl

[3] Shao F. M., Zhao L. C., “Topological Optimization of Computer Network Expansion with Reliability Constraint”, Computers and Mathematics with Applications, 35:15 (1998), 17–26 | DOI | MR | Zbl

[4] Rodionova O. K., Rodionov A. S., Choo H., “Network Probabilistic Connectivity: Optimal Structures”, ICCSA-2004, LNCS, 3047, Springer-Verlag, 2004, 431–440

[5] Rodionov A., Rodionova O., “Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes”, HPCC-2006, LNCS, 4208, Springer-Verlag, 2006, 101–109

[6] Rodionov A., Rodionova O. K., Choo H., “On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network”, ICCSA-2007, v. 3, LNCS, 4707, Springer-Verlag, 2007, 534–543

[7] Moore E. F., Shannon C. E., “Reliable Circuits Using Less Reliable Relays”, J. Franclin Inst., 262:4b (1956), 191–208 | DOI | MR | Zbl