RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. J. Pure and Appl. Math.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2008, Volume 8, Issue 1, Pages 3–14 (Mi vngu275)  

Using EDP-polynomials in Optimal Structures Choosing

O. A. Gadyatskaya

Novosibirsk State University

Abstract: 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.

Full text: PDF file (323 kB)
References: PDF file   HTML file
UDC: 519.17+519.24
Received: 09.11.2007

Citation: O. A. Gadyatskaya, “Using EDP-polynomials in Optimal Structures Choosing”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:1 (2008), 3–14

Citation in format AMSBIB
\Bibitem{Gad08}
\by O.~A.~Gadyatskaya
\paper Using EDP-polynomials in Optimal Structures Choosing
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
\yr 2008
\vol 8
\issue 1
\pages 3--14
\mathnet{http://mi.mathnet.ru/vngu275}


Linking options:
  • http://mi.mathnet.ru/eng/vngu275
  • http://mi.mathnet.ru/eng/vngu/v8/i1/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Вестник Новосибирского государственного университета. Серия: математика, механика, информатика
    Number of views:
    This page:115
    Full text:35
    References:21
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020