Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Norbert Sensen. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. PhD thesis, University of Paderborn, 2003. [doi]

Abstract

Abstract is missing.