Any directed graph admits a sparse DAG projection of size m^{1+o(1)} that (1+1/polylog n)-approximates all-pairs distances or n^{o(1)}-approximates subset maximum flows.
Maximum flow by augmenting paths in n^ 2+o(1) time
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A balancing-weights technique lets a randomized augmenting-paths algorithm compute max flow in directed graphs in m + nF time, matching the undirected case.
citing papers explorer
-
DAG Projections: Reducing Distance and Flow Problems to DAGs
Any directed graph admits a sparse DAG projection of size m^{1+o(1)} that (1+1/polylog n)-approximates all-pairs distances or n^{o(1)}-approximates subset maximum flows.
-
Balancing Weights, Directed Sparsification, and Augmenting Paths
A balancing-weights technique lets a randomized augmenting-paths algorithm compute max flow in directed graphs in m + nF time, matching the undirected case.