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