Skip to main content
Article thumbnail
Location of Repository


By Dr. Andreas Karrenbauer and Luca Furrer


In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glencore Borradail and Philip Klein published in 2009 in [1]. Further we are going to present and analyse an implementation of this algorithm. To analyse the maximum flow algorithm we also use an algorithm to find the maximal running time of a an algorithm for planar graphs which is based on transforming maximal planar graphs to other maximal planar graphs by Lawson flips

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.