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]
@article{ReineltTW08,
title = {Computing finest mincut partitions of a graph and application to routing problems},
author = {Gerhard Reinelt and Dirk Oliver Theis and Klaus Michael Wenger},
year = {2008},
doi = {10.1016/j.dam.2007.03.022},
url = {http://dx.doi.org/10.1016/j.dam.2007.03.022},
tags = {graph-rewriting, rewriting, routing, partitioning},
researchr = {https://researchr.org/publication/ReineltTW08},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {156},
number = {3},
pages = {385-396},
}