Results of numerical experiments for the large network

The system demand requirement is denoted by d and the number of all d-MPs is denoted by #d − M P s. The two-terminal network reliability is denoted by R. The running times of the parallel SSD algorithm [18], the serial bounding algorithm [19] with the accuracy of the reliability bound γ = 0.01, 0, and the presented algorithm are expressed in seconds [s] and denoted by T_B , T_L, T_L0 , and T_K , respectively. Moreover, there are presented the running time [s] of the chunk of the presented algorithm responsible for determining all d-MPs and lower bounds for the network reliability – T_d, as well as the running time [s] T_N of the algorithm [6] also determining all d-MPs

系统需求要求记为d，全体d-MPs的数量记为#d-MPs。双终端网络可靠性（two-terminal network reliability）记为R。并行SSD算法（parallel SSD algorithm）[18]、精度设置为可靠性界γ=0.01与γ=0的串行界算法（serial bounding algorithm）[19]，以及本文提出算法的运行时长（单位：秒[s]）分别记为T_B、T_L、T_L0与T_K。此外，本文还给出了本文提出算法中负责枚举全部d-MPs并计算网络可靠性下界的代码块的运行时长（单位：秒[s]）T_d，以及同样用于枚举全部d-MPs的算法[6]的运行时长T_N。