Paper Info
Title
Recent Progress on Graph Partitioning Problems Using Evolutionary Computation.
Abstract
The graph partitioning problem (GPP) is a representative combinatorial optimization problem which is NP-hard. Currently, various approaches to solve GPP have been introduced. Among these, the GPP solution using evolutionary computation (EC) is an effective approach. There has not been any survey on the research applying EC to GPP since 2011. In this survey, we introduce various attempts to apply EC to GPP made in the recent seven years.
Year
Venue
Field
2018
arXiv: Neural and Evolutionary Computing
Mathematical optimization,Combinatorial optimization problem,Computer science,Evolutionary computation,Graph partition
DocType
Volume
Citations 
Journal
abs/1805.01623
0
PageRank 
References 
Authors
0.34
11
2
Name
Order
Citations
PageRank
Hye-Jin Kim13917.46
Yong-Hyuk Kim235540.27