We propose a new heuristic for vertex ordering and a method that splits the vertex ordering into clusters. We apply them to the graph partitioning problem. The application of these ideas incorporates reordering in genetic algorithms and the identification of clustered structures in graphs. Experimental tests on benchmark graphs showed that the new vertex-ordering scheme performed better than existing methods in terms of genetic algorithms, and that the clusters were successfully captured.
Digital Object Identifier (DOI)
Yoon, Yourim and Kim, Yong-Hyuk
"Vertex Ordering, Clustering, and Their Application to Graph Partitioning,"
Applied Mathematics & Information Sciences: Vol. 08:
1, Article 16.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss1/16