An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semide nite programming and polyhedral relaxations. We report on extensive numerical experiments which were performed for various classes of graphs. The results indicate that the present approach solves general problem instances with 80 90 vertices exactly in reasonable time, and provides tight approximations for larger instances. Our approach is particularly well suited for special classes of graphs as planar graphs and graphs based on grid structures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.