Solving the maximum flow problem yields one qualified minimal cut. But I want several (maybe hundreds) small cuts as candidates. The cuts don't have to be minimum cuts, as long as they are small (in weight). How do I do that?
In s-t directed graph, how to find many small cuts?
algorithms;graphs;graph theory;optimization;approximation