Approximate maximum flow on separable undirected graphs

DOI10.1137/1.9781611973105.83MaRDI QIDQ5741792zbMATH OpenOpenAlexFDO

Authors Richard Peng, Gary L. Miller

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.5227

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Abstract: We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive $sqrtn$-vertex separator structure, our algorithm finds an $1-epsilon$ approximate maximum flow in time $ildeO(m^{6/5}polyepsilo{n}^{-1})$, ignoring poly-logarithmic terms. Similar speedups are also achieved for separable graphs with larger size separators albeit with larger run times. These bounds also apply to image problems in two and three dimensions. Key to our algorithm is an intermediate problem that we term grouped $L_2$ flow, which exists between maximum flows and electrical flows. Our algorithm also makes use of spectral vertex sparsifiers in order to remove vertices while preserving the energy dissipation of electrical flows. We also give faster spectral vertex sparsification algorithms on well separated graphs, which may be of independent interest.

Recommendations

• Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
• Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
• A new approach to computing maximum flows using electrical flows
• Graph partitioning using single commodity flows
• Graph partitioning using single commodity flows

Cited in

(14)

• scientific article; zbMATH DE number 6501391 (Why is no real title available?)
• An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
• scientific article; zbMATH DE number 176498 (Why is no real title available?)
• Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
• Conditional Lower Bounds for All-Pairs Max-Flow
• An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
• Dynamic effective resistances and approximate Schur complement on separable graphs
• The power of vertex sparsifiers in dynamic graph algorithms
• Deterministic approximation of random walks in small space
• Solving Maximum Flow Problems on Real World Bipartite Graphs
• Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
• Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
• Harmonic analysis invariants for infinite graphs via operators and algorithms
• Maximum \(k\)-splittable \(s, t\)-flows

This page was built for publication: Approximate maximum flow on separable undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741792)