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]

Authors

Gerhard Reinelt

This author has not been identified. Look up 'Gerhard Reinelt' in Google

Dirk Oliver Theis

This author has not been identified. Look up 'Dirk Oliver Theis' in Google

Klaus Michael Wenger

This author has not been identified. Look up 'Klaus Michael Wenger' in Google