An exact combinatorial algorithm for minimum graph bisection
Author(s)Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.
MetadataShow full item record
We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We introduce novel lower bounds based on packing trees, as well as a new decomposition technique that contracts entire regions of the graph while preserving optimality guarantees. Our algorithm works particularly well on graphs with relatively small minimum bisections, solving to optimality several large real-world instances (with up to millions of vertices) for the first time.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Springer Berlin Heidelberg
Delling, Daniel, Daniel Fleischman, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck. “An Exact Combinatorial Algorithm for Minimum Graph Bisection.” Math. Program. 153, no. 2 (September 10, 2014): 417–458.
Author's final manuscript