absorb.md

Computer Science

Jason Calacanis1Ethan Mollick1Asianometry1
No compiled wiki article for this topic yet. Raw entries below are the source material — a wiki article can be generated on demand from /admin/triggers.

New Algorithm Improves Max Flow for Sparse Directed Graphs

This paper introduces a randomized augmenting paths-based algorithm for computing maximum flow in directed, uncapacitated graphs. It achieves a running time of $mn^{1/2+o(1)}$ by combining a novel edge re-weighting technique with initial blocking flow rounds. This represents the first improvement ov