Mathematical Programming

, Volume 153, Issue 2, pp 417–458

An exact combinatorial algorithm for minimum graph bisection

  • Daniel Delling
  • Daniel Fleischman
  • Andrew V. Goldberg
  • Ilya Razenshteyn
  • Renato F. Werneck
Full Length Paper Series A

DOI: 10.1007/s10107-014-0811-z

Cite this article as:
Delling, D., Fleischman, D., Goldberg, A.V. et al. Math. Program. (2015) 153: 417. doi:10.1007/s10107-014-0811-z

Abstract

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.

Keywords

Bisection Branch-and-bound Graph partition  Combinatorial algorithms 

Mathematics Subject Classification

90C27 90C35 90C57 05C85 

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2014

Authors and Affiliations

  • Daniel Delling
    • 1
  • Daniel Fleischman
    • 2
  • Andrew V. Goldberg
    • 1
  • Ilya Razenshteyn
    • 3
  • Renato F. Werneck
    • 1
  1. 1.Microsoft Research Silicon ValleyMountain ViewUSA
  2. 2.School of Operations Research and Information EngineeringCornell UniversityIthacaUSA
  3. 3.Computer Science and Artificial Intelligence LaboratoryMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations