Skip to main content
Article thumbnail
Location of Repository

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

By Glencora Borradaile and Philip Klein

Abstract

We give the first correct O(n log n) algorithm for finding a maximum st-flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual s-to-t path

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1672
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.uwaterloo.ca/~... (external link)
  • Suggested articles


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