, Volume 20, Issue 3, pp 445–450 | Cite as

NOTE – On Minimizing Symmetric Set Functions

  • Romeo Rizzi

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.

AMS Subject Classification (1991) Classes:  05C85 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society, 2000

Authors and Affiliations

  • Romeo Rizzi
    • 1
  1. 1.CWI; P.O. Box 94079, 1090 GB Amsterdam, The Netherlands; E-mail: romeo@cwi.nlNL

Personalised recommendations