Bernstein, A., Blikstad, J., Saranurak, T., & Tu, T. (2024). Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time.
Cita Chicago Style (17a ed.)Bernstein, Aaron, Joakim Blikstad, Thatchaphol Saranurak, y Ta-Wei Tu. Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time. 2024.
Cita MLA (9a ed.)Bernstein, Aaron, et al. Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time. 2024.
Precaución: Estas citas no son 100% exactas.