Experiment 1: Results of numerical experiments for the small network from Fig. 2

The 'Ex_1.csv' file contains the results of the numerical experiments described in Section 4.1. Experiment 1.Notation occurring in the 'Ex_1.csv' file:d - the system demand requirement;#d-MPs - the number of all d-MPs;rel_J, rel_A, rel_B, rel_L, rel_Lp, rel_K1, rel_K2 - the two terminal reliability (or reliability bounds) returned by algorithms: DOI: 10.1109/TR.2008.920792, DOI: 10.1109/TR.1985.5222235, DOI: 10.1109/TR.2020.2988987, the serial bounding algorithm described in article DOI: 10.1016/j.ress.2021.107500, the series-parallel bounding algorithm described in article DOI: 10.1016/j.ress.2021.107500 and the presented algorithm with parameter p=1,2, respectively;tim_J, tim_A, tim_B, tim_L, tim_Lp, tim_K1, tim_K2 - the running times of algorithms: DOI: 10.1109/TR.2008.920792, DOI: 10.1109/TR.1985.5222235, DOI: 10.1109/TR.2020.2988987, the serial bounding algorithm described in article DOI: 10.1016/j.ress.2021.107500, the series-parallel bounding algorithm described in article DOI: 10.1016/j.ress.2021.107500 and the 'Kozyra_part_SSD' procedure with parameter p=1,2, respectivelytim_Kd - the running time of the 'Kozyra_d_MPs_Part' proceduren_LU - the length of the list L_L_U (the number of limiting state points of subspaces without d-MPs).<br><br>