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.
Stochastic embedding of digraphs into dags
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
The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.
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.
-
Revisiting Diameter in Directed Graphs
The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.