Approximate Maximum Flow on Separable Undirected Graphs
From MaRDI portal
Publication:5741792
DOI10.1137/1.9781611973105.83zbMath1422.68308arXiv1210.5227OpenAlexW2953026212MaRDI QIDQ5741792
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
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Flows in graphs (05C21)
Related Items (4)
Harmonic analysis invariants for infinite graphs via operators and algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Approximate Maximum Flow on Separable Undirected Graphs