9 citations · 17 across the 9 of their papers we have counts for
1 paper · 2 filters
S. Shine, K. Murali Krishnan
A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-fl…