u, v
) of nodes such that the star of v is a minimum cut separating u and v. Nagamochi and Ibaraki showed that the last two nodes of a ``max-back order'' form such a pair and used this fact to develop an elegant min-cut algorithm. M. Queyranne extended this approach to minimize symmetric submodular functions. With the help of a short and simple proof, here we show that the same algorithm works for an even more general class of set functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 16, 1998
Rights and permissions
About this article
Cite this article
Rizzi, R. NOTE – On Minimizing Symmetric Set Functions. Combinatorica 20, 445–450 (2000). https://doi.org/10.1007/s004930070017
Issue Date:
DOI: https://doi.org/10.1007/s004930070017