Gerhard Reinelt Dirk Oliver Theis Klaus Michael Wenger Computing finest mincut partitions of a graph and application to routing problems. 385-396 2008 156 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2007.03.022 db/journals/dam/dam156.html#ReineltTW08