Skip to main content
Article thumbnail
Location of Repository

Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time

By Philip N. Klein and Shay Mozes

Abstract

We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter*n*log(n)) algorithm for the problem.Comment: proofs included. preliminary version to appear in WADS 201

Topics: Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms
Year: 2011
OAI identifier: oai:arXiv.org:1104.4728
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.4728 (external link)
  • Suggested articles


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