Speeding up computation of the reliability polynomial coefficients for a random graph

Speeding up computation of the reliability polynomial coefficients for a random graph

0.00 Avg rating0 Votes
Article ID: iaor20117959
Volume: 72
Issue: 7
Start Page Number: 1474
End Page Number: 1486
Publication Date: Jul 2011
Journal: Automation and Remote Control
Authors:
Keywords: quality & reliability, graphs
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.

Reviews

Required fields are marked *. Your email address will not be published.