An Overview of Algorithms for Network Survivability
Figure 1
Example of a cactus construction for a 4-node ring topology. The top “row” gives the graphs , for . The second row gives the paths , for . The third row presents the first iteration of the for loop in algorithm Build-Cactus, while the fourth row presents the last iteration. The last row presents the cactus representation of the ring, which is a ring itself.
