Answers are grounded in this paper and cite their sources.
In this paper, we compare the performance of two popular graph bisection algorithms. We also present an empirical study of a new heuristic, first proposed in [B87], that dramatically improves the performance of these bisection algorithms on graphs with small (≤ 4) average degree.
No takes yet. Share an insight, caveat, or question.
Bui et al. (1989) studied this question.