Using EDP-polynomials in Optimal Structures Choosing
    
    
  
  
  
      
      
      
        
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 1, pp. 3-14
    
  
  
  
  
  
    
      
      
        
      
      
      
    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.
			
            
            
            
          
        
      @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},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2008_8_1_a0/}
}
                      
                      
                    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/
