Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time. - Ivona Bezáková; Adam J. Friedlander (MFCS, 2010)

Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. - Ivona Bezáková; Adam J. Friedlander (Theor. Comput. Sci., 2012)