TY - JOUR A1 - Grötschel, Martin A1 - Nemhauser, George T1 - A polynomial algorithm for the max-cut problem on graphs without long odd cycles JF - Mathematical Programming Y1 - 1984 VL - 29 IS - 1 SP - 28 EP - 40 PB - North-Holland ER -