DocumentCode :
131306
Title :
An efficient genetic algorithm for the feedback set problems
Author :
Noughabi, Havva Alizadeh ; Baghbani, Farzaneh Ghayour
Author_Institution :
Dept. of Comput. Eng., Higher Educ. Complex of Gonabad, Gonabad, Iran
fYear :
2014
fDate :
4-6 Feb. 2014
Firstpage :
1
Lastpage :
4
Abstract :
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.
Keywords :
directed graphs; genetic algorithms; FSP; acyclic graphs; directed graph arcs; feedback set problems; genetic algorithm; graph theory; relational information visualization systems; Algorithm design and analysis; Approximation algorithms; Approximation methods; Genetic algorithms; Graph theory; Inference algorithms; Labeling; Genetic algorithm; directed graph; feedback arc set;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems (ICIS), 2014 Iranian Conference on
Conference_Location :
Bam
Print_ISBN :
978-1-4799-3350-1
Type :
conf
DOI :
10.1109/IranianCIS.2014.6802571
Filename :
6802571
Link To Document :
بازگشت