Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Max Flows in Planar Graphs with Vertex Capacities

Max Flows in Planar Graphs with Vertex Capacities We consider the maximum flow problem in directed planar graphs with capacities on both vertices and arcs and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in O(min {k2 n, n log3 n + kn}) time when all capacities are bounded by a constant, 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 linear time when k is fixed but larger than 2. The second algorithm runs in O(k5 Δ n polylog (nU)) time, where each arc capacity and finite vertex capacity is bounded by U, and Δ is the maximum degree of the graph. Finally, when k = 3, we present an algorithm that runs in O(n log 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 fixed and U is bounded by a polynomial in n. Prior to this result, the fastest algorithms ran in O(n4/3+o(1)) time for unit capacities; in the smallest of O(n3/2log n log U), Õ(n10/7U1/7), O(n11/8+o(1)U1/4), and O(n4/3 + o(1)U1/3) time for integer capacities; and in O(n2/log n) time for real capacities, even when k = 3. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

Max Flows in Planar Graphs with Vertex Capacities

Wang, Yipu
ACM Transactions on Algorithms (TALG) , Volume 18 (1): 27 – Jan 22, 2022
Download PDF
27 pages

Loading next page...
 
/lp/association-for-computing-machinery/max-flows-in-planar-graphs-with-vertex-capacities-3wVV877X5j
Publisher
Association for Computing Machinery
Copyright
Copyright © 2022 Association for Computing Machinery.
ISSN
1549-6325
eISSN
1549-6333
DOI
10.1145/3504032
Publisher site
See Article on Publisher Site

Abstract

We consider the maximum flow problem in directed planar graphs with capacities on both vertices and arcs and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in O(min {k2 n, n log3 n + kn}) time when all capacities are bounded by a constant, 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 linear time when k is fixed but larger than 2. The second algorithm runs in O(k5 Δ n polylog (nU)) time, where each arc capacity and finite vertex capacity is bounded by U, and Δ is the maximum degree of the graph. Finally, when k = 3, we present an algorithm that runs in O(n log 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 fixed and U is bounded by a polynomial in n. Prior to this result, the fastest algorithms ran in O(n4/3+o(1)) time for unit capacities; in the smallest of O(n3/2log n log U), Õ(n10/7U1/7), O(n11/8+o(1)U1/4), and O(n4/3 + o(1)U1/3) time for integer capacities; and in O(n2/log n) time for real capacities, even when k = 3.

Journal

ACM Transactions on Algorithms (TALG) – Association for Computing Machinery

Published: Jan 22, 2022

Keywords: Planar graphs

References

  • Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
    [,
  • An {O}(n \log n) algorithm for maximum st-flow in a directed planar graph
    [,
  • A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
    [,
  • Shortest vertex-disjoint two-face paths in planar graphs
    [,
  • Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
    [,
  • A faster algorithm for maximum flow in directed planar graphs with vertex capacities
    [,
  • Maximum flows and parametric shortest paths in planar graphs
    [,
  • Flows in Networks
    [,
  • Beyond the flow decomposition barrier
    [,
  • A contraction procedure for planar directed graphs
    [,
  • Faster shortest-path algorithms for planar graphs
    [,
  • Flow Rounding
    [,
  • Maximum flow in directed planar graphs with vertex capacities
    [,
  • Unit capacity maxflow in almost O(m^{4/3}) time
    [,
  • The lattice structure of flow in planar graphs
    [,
  • Flow in planar graphs with vertex capacities
    [,
  • Sur le problème des courbes gauches en topologie
    [,
  • Faster energy maximization for faster maximum flow
    [,
  • Flow in planar graphs with multiple sources and sinks
    [,
  • Computing maximum flow with augmenting electrical flows
    [,
  • Max flows in {O}(nm) time, or better
    [,
  • A data structure for dynamic trees
    [,
  • Maximum integer flows in directed planar graphs with vertex capacities and multiple sources and sinks
    [,
  • Computing maximum flows in undirected planar networks with both edge and vertex capacities
    [,
  • Flow equivalent trees in node-edge-capacitated undirected planar graphs
    [,