DMCA
Exact Combinatorial Branch-and-Bound for Graph Bisection
| Citations: | 7 - 3 self |
BibTeX
@MISC{Delling_exactcombinatorial,
author = {Daniel Delling and Andrew V. Goldberg and Ilya Razenshteyn and Renato F. Werneck},
title = {Exact Combinatorial Branch-and-Bound for Graph Bisection },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equallysized 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 present stronger lower bounds, improved branching rules, and a new decomposition technique that contracts entire regions of the graph without losing optimality guarantees. In practice, our algorithm works particularly well on instances with relatively small minimum bisections, solving large real-world graphs (with tens of thousands to millions of vertices) to optimality.
Keyphrases
graph bisection exact combinatorial branch-and-bound branch-and-bound framework novel exact algorithm minimum graph bisection problem new decomposition technique previous approach small minimum bisection equallysized cell optimality guarantee branching rule contract entire region large real-world graph
