Breaking the O(n^2.5) deterministic time barrier for undirected unit-capacity maximum flow

DOI10.1137/1.9781611973105.84MaRDI QIDQ5741793zbMATH OpenOpenAlexFDO

Authors Ran Duan

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://doi.org/10.1137/1.9781611973105.84

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Flows in Undirected Unit Capacity Networks
• scientific article; zbMATH DE number 742960
• AO(nm log(U/n)) time maximum flow algorithm
• An o(n^3 )-Time Maximum-Flow Algorithm
• scientific article; zbMATH DE number 1775390

Cited in

(4)

• Reconstructing edge-disjoint paths faster
• New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
• New algorithms and lower bounds for all-pairs max-flow in undirected graphs
• Deterministic maximum flows in simple graphs

This page was built for publication: Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow

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