“…In this subsection, the case of (1, 2) ∈ 1 c is presented to illustrate the steps for identification of reduced number of k-line contingencies at 2 ≤ k ≤ 4 using successive k-line failure identification and topological k-line contingency selection algorithms in the IEEE 30 bus system. The top few lines obtained by sorting the solution of Equation ( 13) at k = 1 are given by 1 c = { (1, 2), (1,3), (2,5), (2,6), (3,4), (4,6), (4,12), (6,7), (6,8), (6,9),(6, (27,28), (24,25), (25,27), (10,20), (4,12), (23,24), (15,23), (6,28), (15,18), (10,17)} with t = 11 are shown in Figure 7. c at k = 2.…”