Speeding up Computation of the Reliability Polynomial Coefficients for a Random Graph

被引：3
|
作者：
Rodionov, A. S. [1 ]
机构：
[1] Russian Acad Sci, Inst Computat Math & Math Geophys, Siberian Branch, Novosibirsk, Russia
来源：
AUTOMATION AND REMOTE CONTROL | 2011年 / 72卷 / 07期
关键词：
Remote Control; Span Tree; Random Graph; Exact Computation; Network Reliability;
D O I：
10.1134/S0005117911070150
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1474 / 1486
页数：13
相关论文
共 50 条
  • [21] Speeding up AdaBoost Classifier with Random Projection
    Paul, Biswajit
    Athithan, G.
    Murty, M. Narasimha
    ICAPR 2009: SEVENTH INTERNATIONAL CONFERENCE ON ADVANCES IN PATTERN RECOGNITION, PROCEEDINGS, 2009, : 251 - 254
  • [22] A STRATEGY FOR SPEEDING-UP THE COMPUTATION OF CHARACTERISTIC SETS
    WANG, DM
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 504 - 510
  • [23] Fast incremental algorithm for speeding up the computation of binarization
    Chung, Kuo-Liang
    Tsai, Chia-Lun
    APPLIED MATHEMATICS AND COMPUTATION, 2009, 212 (02) : 396 - 408
  • [24] Speeding up the Computation of the Transient Richards' Equation with AMGCL
    Pinzinger, Robert
    Blankenburg, Rene
    WATER, 2020, 12 (01)
  • [25] Speeding up the discrete log computation on curves with automorphisms
    Duursma, I
    Gaudry, P
    Morain, F
    ADVANCES IN CRYPTOLOGY - ASIACRYPT'99, PROCEEDINGS, 1999, 1716 : 103 - 121
  • [26] Speeding up random walks with neighborhood exploration
    Berenbrink, Petra
    Cooper, Colin
    Elsaesser, Robert
    Radzik, Tomasz
    Sauerwald, Thomas
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1422 - +
  • [27] Efficient computation of the characteristic polynomial of a threshold graph
    Furer, Martin
    THEORETICAL COMPUTER SCIENCE, 2017, 657 : 3 - 10
  • [28] Efficient Computation of the Characteristic Polynomial of a Threshold Graph
    Fuerer, Martin
    FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 45 - 51
  • [29] Speeding up image computation by using RTL information
    Meinel, C
    Stangier, C
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2000, 1954 : 443 - 454
  • [30] Speeding up the computation of the edit distance for cyclic strings
    Marzal, A
    Barrachina, S
    15TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, PROCEEDINGS: PATTERN RECOGNITION AND NEURAL NETWORKS, 2000, : 891 - 894
12345