Better Bounds for Graph Bisection

Daniel Delling and Renato Werneck


We introduce new lower bounds for the minimum graph bisection problem. Within a branch-and-bound framework, they enable the solution of a wide variety of instances with tens of thousands of vertices to optimality. Our algorithm compares favorably with the best previous approaches, solving long-standing open instances in minutes.


Publication typeTechReport
PublisherMicrosoft Technical Report
> Publications > Better Bounds for Graph Bisection