Meinolf Sellmann, Norbert Sensen, Larissa Timajev. Multicommodity Flow Approximation Used for Exact Graph Partitioning. In Giuseppe Di Battista, Uri Zwick, editors, Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings. Volume 2832 of Lecture Notes in Computer Science, pages 752-764, Springer, 2003. [doi]
@inproceedings{SellmannST03,
title = {Multicommodity Flow Approximation Used for Exact Graph Partitioning},
author = {Meinolf Sellmann and Norbert Sensen and Larissa Timajev},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2832&spage=752},
tags = {data-flow, graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/SellmannST03},
cites = {0},
citedby = {0},
pages = {752-764},
booktitle = {Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings},
editor = {Giuseppe Di Battista and Uri Zwick},
volume = {2832},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-20064-9},
}