Second Smallest $s$-$t$-Cut in a Network Is anything known about the second smallest $s$-$t$-cut in a flow network? Or, more general, about this problem:


  Input: A network $N$ and a number $k$, all in binary.
  Output: A $k$th smallest $s$-$t$ cut.


A $k$th smallest $s$-$t$ cut $(S,T)$ is any $s$-$t$ cut, such that there are exactly $k-1$ $s$-$t$ cuts whose capacities 


are pairwise different and 
truly smaller than the capacity of $(S,T)$.


I would like to know how it can be computed and whether this can be done efficiently as for the case $k=1$.
The second smallest cut, and more generally the $k$ smallest cuts, can be found in time polynomial in $k$ and the network size. See:

H. W. Hamacher. An $(K\cdot n^4)$ algorithm for finding the $k$ best cuts in a network. Oper. Res. Lett. 1(5):186–189, 1982, doi:10.1016/0167-6377(82)90037-2.

H. W. Hamacher, J.-C. Picard, and M. Queyranne. On finding the $K$ best cuts in a network. Oper. Res. Lett. 2(6):303–305, 1984, doi:10.1016/0167-6377(84)90083-X.

H. W. Hamacher and M. Queyranne. $K$ best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1–4):123–143, 1985, doi:10.1007/BF02022039.