Breaking the O(n2.5) Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow

DOI10.1137/1.9781611973105.84zbMath1421.68120OpenAlexW4253148995MaRDI QIDQ5741793

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

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

Related Items (1)

Reconstructing edge-disjoint paths faster

This page was built for publication: Breaking the O(n^2.5) Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow