0 citations0 referencesGoogle Scholardoi.orgAn efficient algorithm for the minimum capacity cut problemMathematical Programming·1990·Vol. 47(1-3), pp. 19–36Citations Over TimeTop 10% of 1990 papersManfred Padberg, Giovanni RinaldiRelated Papers→ A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem(2002)13 cited→ On the minimum rank of a graph over finite fields(2011)1 cited→ Faster algorithms for finding a minimum K-way cut in a weighted graph(2002)9 cited