Multilevel graph partitioning: an evolutionary approach


Kucupetek S., Polat F., Oguztuzun H.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, vol.56, no.5, pp.549-562, 2005 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 56 Issue: 5
  • Publication Date: 2005
  • Doi Number: 10.1057/palgrave.jors.2601837
  • Journal Name: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Journal Indexes: Science Citation Index Expanded, Social Sciences Citation Index, Scopus
  • Page Numbers: pp.549-562

Abstract

The graph partitioning problem is defined as that of dividing the vertices of an undirected graph into a set of balanced parts through the removal of a set of edges, whose size is to be minimized. A number of researchers have investigated multilevel schemes, which coarsen the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partitioning of the original graph. In this paper, a genetic algorithm for the coarsening phase of a multilevel scheme for graph partitioning is presented. The proposed approach has been demonstrated to improve the solution quality at the expense of running time.