An $O(n\log n)$ algorithm for maximum $st$-flow in a directed planar graph

Glencora Borradaile and Philip N. Klein
Proc. 17th Symp. Discrete Algorithms, ACM and SIAM, Jan 2006, pp. 524–533

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!