A graph is edge-biconnected if it requires the removal of at least two edges to disconnect it. Assume that we have weighted graph that is not biconnected, and an additional set of augmentation edges. The (NP-hard) edge biconnectivity augmentation problem is to select a minimal subset of the augmentation edges, whose inclusion will cause the graph to be biconnected. This paper explores the application of particle swarm optimization and genetic algorithms for this problem.
Date of creation, presentation, or exhibit
Department, Program, or Center
Microelectronic Engineering (KGCOE)
Rao, T.; Rao, Raghuveer; Sahin, Ferat; and Tillett, Jason, "Evolutionary algorithms for the edge biconnectivity augmentation problem" (2003). Accessed from
RIT – Main Campus