Iterated multilevel simulated annealing for large-scale graph conductance minimization

Given an undirected connected graph G = (V, E) with vertex set V and edge set E, the minimum conductance graph partitioning problem is to partition V into two disjoint subsets such that the conductance, i.e., the ratio of the number of cut edges to the smallest volume of two partition subsets is minimized. This problem has a number of practical applications in various areas such as community detection, bioinformatics, and computer vision. However, the problem is computationally challenging, especially for large problem instances. This work presents the first iterated multilevel simulated annealing algorithm for large-scale graph conductance minimization. The algorithm features a novel solution guided coarsening method and an effective solution refinement procedure based on simulated annealing. Computational experiments demonstrate the high performance of the algorithm on 66 very large real-world sparse graphs with up to 23 million vertices. Additional experiments are presented to get insights into the influences of its algorithmic components. The source code of the proposed algorithm is publicly available, which can be used to solve various real world problems. (c) 2021 Elsevier Inc. All rights reserved.

Automated summary

This paper introduces an iterated multilevel simulated annealing algorithm for large-scale graph conductance minimization, demonstrating high performance on very large real-world sparse graphs, with publicly available source code.