Paperlane

no. 10 · Friday 6 November 2026

All minimum cuts of symmetric submodular functions

Chao Xu

math.CO · via cs.DS

Abstract

We compute Cunningham's canonical decomposition of a symmetric submodular function on $n$ elements in $O(n^3)$ time. The decomposition represents all minimum cuts in linear space. For the pair $s,t$ produced by Queyranne's algorithm, we construct in $O(n^2)$ time a digraph representing exactly the minimum $st$-cuts of the function. Using this construction in Chekuri and Xu's decomposition algorithm gives the cubic bound.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.08253 ↗