Better Bounds for Graph Bisection

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.

edgebisection_TR.pdf
PDF file

Publisher  Microsoft Technical Report

Details

TypeTechReport
NumberMSR-TR-2012-69
> Publications > Better Bounds for Graph Bisection