Computing finest mincut partitions of a graph and application to routing problems

Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger. Computing finest mincut partitions of a graph and application to routing problems. Discrete Applied Mathematics, 156(3):385-396, 2008. [doi]

Abstract

Abstract is missing.