Maximum Flow in Directed Planar Graphs with Vertex Capacities

Details Maximum Flow in Directed Planar Graphs with Vertex Capacities Maximum Flow in Directed Planar Graphs with Vertex Capacities

2009-05-04

arxiv.org/abs/0905.0451v1

Computer Science

Discrete Mathematics

12 pages, 5 figures

Scientific paper

In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then our algorithm can be implemented in O(n) time. For general (not planar) graphs, vertex capacities do not make the problem more difficult, as there is a simple reduction that eliminates vertex capacities. However, this reduction does not preserve the planarity of the graph. The essence of our algorithm is a different reduction that does preserve the planarity, and can be implemented in linear time. For the special case of undirected planar graph, an algorithm with the same time complexity was recently claimed, but we show that it has a flaw.

Affiliated with

Also associated with

No associations

Rating

Maximum Flow in Directed Planar Graphs with Vertex Capacities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Flow in Directed Planar Graphs with Vertex Capacities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Flow in Directed Planar Graphs with Vertex Capacities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200055