|
Avtomatika i Telemekhanika, 2011, Issue 7, Pages 134–146
(Mi at2251)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Stochastic Systems, Queuing Systems
Speeding up computation of the reliability polynomial coefficients for a random graph
A. S. Rodionov Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
We consider the problem of computing the coefficients of the reliability polynomial (RP) for a random graph with reliable vertices and unreliable edges. To speed up the computation, we use the meaning of RP coefficients in one of its representations and prove vector relations over vectors of binomial coefficients.
Citation:
A. S. Rodionov, “Speeding up computation of the reliability polynomial coefficients for a random graph”, Avtomat. i Telemekh., 2011, no. 7, 134–146; Autom. Remote Control, 72:7 (2011), 1474–1486
Linking options:
https://www.mathnet.ru/eng/at2251 https://www.mathnet.ru/eng/at/y2011/i7/p134
|
Statistics & downloads: |
Abstract page: | 371 | Full-text PDF : | 169 | References: | 45 | First page: | 11 |
|