This page shows **all publications** that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with
author names.

**
Show all publications of the year
ALL, with author Rinaldi G., in the category IASI Research Reports
(or show them all):**

IASI Research Report n. 166 (Previous Next) Giovanni Rinaldi,

Padberg M.An efficient algorithm for the minimum capacity cut problem in large sparse graphs.ABSTRACT Given a finite undirected graph with nonnegative edge weights the minimum capacity cut problem consists of partitioning the graph into two nonempty sets such that the sum of the weights of the edges connecting the two parts is minimum among all possible partitionings. The standard algorithm to calculate a minimum capacity cut, due to Gomory & Hu [1961], runs in O(n^4) time and is difficult to implement. We present an alternative algorithm whose worst-case bound is the same but which is easier to implement and was found empirically to be far superior to the standard algorithm on large sparse graphs.