An efficient genetic algorithm for the feedback set problems

Most of the relational information visualization systems use graphs to represent information. In some applications it is needed to make acyclic graphs, so we have to solve the Feedback Set Problem (FSP). FSP is an important problem in graph theory and asks for a minimum sized subset of arcs of a directed graph whose removal makes the graph acyclic. In this paper we propose a genetic algorithm for FSP. Experimental results show proposed algorithm efficiency in comparison to other algorithms.