Answers are grounded in this paper and cite their sources.
We compute Cunningham's canonical decomposition of a symmetric submodular function on n elements in O(n³) 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²) 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.
No takes yet. Share an insight, caveat, or question.
Chao Xu (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: