Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities

04/23/2018
by   Yipu Wang, et al.
0

We consider the problem of finding maximum flows in planar graphs with capacities on both vertices and edges and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in O(n ^3 n + kn) time when all capacities are bounded, where n is the number of vertices in the graph and k is the number of terminals. This algorithm is the first to solve the vertex-disjoint paths problem in near-linear time when k is bounded but larger than 2. The second algorithm runs in O(k^2(k^3 + Δ) n polylog (nU)) time, where U is the largest finite capacity of a single vertex and Δ is the maximum degree of a vertex. Finally, when k=3, we present an algorithm that runs in O(n n) time; this algorithm works even when the capacities are arbitrary reals. Our algorithms improve on the fastest previously known algorithms when k and Δ are small and U is bounded by a polynomial in n. Prior to this result, the fastest algorithms ran in O(n^2 / n) time for real capacities and O(n^3/2 n U) for integer capacities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2021

A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities

The most efficient algorithm currently known for computing maximum integ...
research
01/08/2019

Faster parameterized algorithm for pumpkin vertex deletion set

A directed graph G is called a pumpkin if G is a union of induced paths ...
research
08/26/2022

Testing Upward Planarity of Partial 2-Trees

We present an O(n^2)-time algorithm to test whether an n-vertex directed...
research
04/23/2019

Maximizing Communication Throughput in Tree Networks

A widely studied problem in communication networks is that of finding th...
research
02/05/2021

Minimum projective linearizations of trees in linear time

The minimum linear arrangement problem (MLA) consists of finding a mappi...
research
03/08/2021

A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph

We consider the problem of counting the number of vertices reachable fro...
research
01/18/2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao

We give an algorithm for computing exact maximum flows on graphs with m ...

Please sign up or login with your details

Forgot password? Click here to reset