Haim Kaplan, Yahav Nussbaum. Maximum Flow in Directed Planar Graphs with Vertex Capacities. In Amos Fiat, Peter Sanders, editors, Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings. Volume 5757 of Lecture Notes in Computer Science, pages 397-407, Springer, 2009. [doi]
@inproceedings{KaplanN09-0,
title = {Maximum Flow in Directed Planar Graphs with Vertex Capacities},
author = {Haim Kaplan and Yahav Nussbaum},
year = {2009},
doi = {10.1007/978-3-642-04128-0_36},
url = {http://dx.doi.org/10.1007/978-3-642-04128-0_36},
tags = {planar graph, data-flow, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KaplanN09-0},
cites = {0},
citedby = {0},
pages = {397-407},
booktitle = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings},
editor = {Amos Fiat and Peter Sanders},
volume = {5757},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-04127-3},
}