This article is cited 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.

Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 24.08.2010

 English version: Automation and Remote Control, 2011, 72:7, 1474–1486

Bibliographic databases:

• 
• 
• 
•