Minimum Cuts in Directed Graphs via √n Max-Flows.
Publication
, Journal Article
Cen, R; Li, J; Nanongkai, D; Panigrahi, D; Saranurak, T
Published in: CoRR
2021
Duke Scholars
Published In
CoRR
Publication Date
2021
Volume
abs/2104.07898
Citation
APA
Chicago
ICMJE
MLA
NLM
Cen, R., Li, J., Nanongkai, D., Panigrahi, D., & Saranurak, T. (2021). Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR, abs/2104.07898.
Cen, Ruoxu, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, and Thatchaphol Saranurak. “Minimum Cuts in Directed Graphs via √n Max-Flows.” CoRR abs/2104.07898 (2021).
Cen R, Li J, Nanongkai D, Panigrahi D, Saranurak T. Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR. 2021;abs/2104.07898.
Cen, Ruoxu, et al. “Minimum Cuts in Directed Graphs via √n Max-Flows.” CoRR, vol. abs/2104.07898, 2021.
Cen R, Li J, Nanongkai D, Panigrahi D, Saranurak T. Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR. 2021;abs/2104.07898.
Published In
CoRR
Publication Date
2021
Volume
abs/2104.07898