Abstract
In many applications, a function is defined on the cuts of a network. In the max-flow min-cut theorem, the function on a cut is simply the sum of all capacities of edges across the cut, and we want the minimum value of a cut separating a given pair of nodes. To find the minimum cuts separating\((\begin{array}{*{20}c} n \\ 2 \\ \end{array} )\) pairs of nodes, we only needn − 1 computations to construct the cut-tree. In general, we can define arbitrary values associated with all cuts in a network, and assume that there is a routine which gives the minimum cut separating a pair of nodes. To find the minimum cuts separating\((\begin{array}{*{20}c} n \\ 2 \\ \end{array} )\) pairs of nodes, we also only needn − 1 routine calls to construct a binary tree which gives all\((\begin{array}{*{20}c} n \\ 2 \\ \end{array} )\)minimum partitions. The binary tree is analogous to the cut-tree of Gomory and Hu.
Similar content being viewed by others
References
C.K. Cheng and T.C. Hu, Maximum concurrent flow and minimum ratio cut, Technical Report CS88-141, UCSD, La Jolla, CA (1988).
L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Can. J. Math. 8 (3)(1956) 399–404.
L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
R.E. Gomory and T.C. Hu, Multi-terminal network flows, J. SIAM 9 (4) (1961)551–570.
D. Gusfield, Very simple methods for all pairs network flow analysis, SIAM J. Comput., to appear.
R. Hassin, Solution bases of multi-terminal cut problems, Math. Oper. Res. 13 (4) (1988)535–542.
T.C. Hu,Integer Programming and Network Flows (Addison-Wesley, 1969).
T.C. Hu,Combinatorial Algorithms (Addison-Wesley, 1982).
T. Leighton and S. Rao, An approximate max flow min cut theorem for uniform multi-commodity flow problem with applications to approximation algorithm,IEEE Annual Symp. on Foundations of Computer Science (1988), pp. 422–431.
D.W. Matula, Determining edge connectivity inO(nm), Proc. 28th Symp. on Foundations of Computer Science (1987), pp. 249–251.
F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, Technical Report, New Mexico (1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cheng, C.K., Hu, T.C. Ancestor tree for arbitrary multi-terminal cut functions. Ann Oper Res 33, 199–213 (1991). https://doi.org/10.1007/BF02115755
Issue Date:
DOI: https://doi.org/10.1007/BF02115755