Vertex Ordering, Clustering, and Their Application to Graph Partitioning


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… (More)


4 Figures and Tables

Slides referencing similar topics