Jan M. Hochstein, Karsten Weihe. Maximum ::::s-t::::-flow with ::::k:::: crossings in ::::O::::(::::k:::::::3:::::::n:::: log ::::n::::) time. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 843-847, SIAM, 2007. [doi]
@inproceedings{HochsteinW07,
title = {Maximum ::::s-t::::-flow with ::::k:::: crossings in ::::O::::(::::k:::::::3:::::::n:::: log ::::n::::) time},
author = {Jan M. Hochstein and Karsten Weihe},
year = {2007},
doi = {10.1145/1283383.1283473},
url = {http://doi.acm.org/10.1145/1283383.1283473},
tags = {data-flow},
researchr = {https://researchr.org/publication/HochsteinW07},
cites = {0},
citedby = {0},
pages = {843-847},
booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007},
editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein},
publisher = {SIAM},
isbn = {978-0-898716-24-5},
}