Evolutionary algorithms for the edge biconnectivity augmentation problem

Show full item record

Redirect: RIT Scholars content from RIT Digital Media Library has moved from http://ritdml.rit.edu/handle/1850/8900 to RIT Scholar Works http://scholarworks.rit.edu/other/493, please update your feeds & links!
Title: Evolutionary algorithms for the edge biconnectivity augmentation problem
Author: Rao, T.; Rao, Raghuveer; Sahin, Ferat; Tillett, Jason
Abstract: 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.
Description: Copyright 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Record URI: http://hdl.handle.net/1850/8900
Date: 2003-10

Files in this item

Files Size Format View
TRaoProceedings10-2003.pdf 432.6Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML

Advanced Search