Multiple-source single-sink maximum flow in directed planar graphs in O(n1.5 log n) time (2010)

Cached

Download Links

by Philip N. Klein , Shay Mozes
Citations:1 - 1 self

Documents Related by Co-Citation

1 Multiple source, single sink maximum flow in a planar graph – Glencora Borradaile, Christian Wulff-Nilsen
1 Multiple-source multiple-sink maximum flow in planar graphs – Yahav Nussbaum
19 Maximum flow in (s, t) planar networks – R Hassin - 1981
167 Faster Shortest-Path Algorithms for Planar Graphs – Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian - 1994
84 Finding small simple cycle separators for 2-connected planar graphs – G L MILLER - 1984