The following publications are possibly variants of this publication:
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear TimeGlencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen. focs 2011: 170-179 [doi]
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter ยท n log n) TimePhilip N. Klein, Shay Mozes. wads 2011: 571-582 [doi]
- Maximum Flow in Directed Planar Graphs with Vertex CapacitiesHaim Kaplan, Yahav Nussbaum. esa 2009: 397-407 [doi]
- Maximum Flow in Directed Planar Graphs with Vertex CapacitiesHaim Kaplan, Yahav Nussbaum. algorithmica, 61(1):174-189, 2011. [doi]
- An ::::O (n log n):::: algorithm for maximum ::::st::::-flow in a directed planar graphGlencora Borradaile, Philip N. Klein. soda 2006: 524-533 [doi]
- An ::::O::::(::::n:::: log ::::n::::) algorithm for maximum ::::st::::-flow in a directed planar graphGlencora Borradaile, Philip N. Klein. JACM, 56(2), 2009. [doi]