Lower bounds to the graph partitioning problem through generalized linear programming and network flows
and
RAIRO-Oper. Res., 21 4 (1987) 349-364
Published online: 06 February 2017
DOI: 10.1051/ro/1987210403491
