A simple minimum T-cut algorithm

Authors:
Romeo Rizzi
Affiliations:
Dipartimento di Informatica e Telecomunicazioni, Università di Trento, via Sommarive 14, 38050 Povo, Italy
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 1
Cited 1

Minimum T-cuts and optimal T-pairings

Discrete Mathematics

Efficient algorithms for computing all low s-t edge connectivities and related problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

We give a simple algorithm for finding a minimum T-cut. At present, all known efficient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad hoc solution. This solution is easier to implement and faster to run. Our results extend to the whole of symmetric submodular functions.