van den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Probst Gutenberg, Maximilian, Sachdeva, Sushant, and Sidford, Aaron. Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. Retrieved from https://par.nsf.gov/biblio/10488620. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) .

van den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Probst Gutenberg, Maximilian, Sachdeva, Sushant, & Sidford, Aaron. Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (). Retrieved from https://par.nsf.gov/biblio/10488620.

van den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Probst Gutenberg, Maximilian, Sachdeva, Sushant, and Sidford, Aaron. "Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time". Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (). Country unknown/Code not available: SIAM. https://par.nsf.gov/biblio/10488620.

@article{osti_10488620,
place = {Country unknown/Code not available}, title = {Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time}, url = {https://par.nsf.gov/biblio/10488620}, abstractNote = {}, journal = {Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)}, publisher = {SIAM}, author = {van den Brand, Jan and Chen, Li and Kyng, Rasmus and Liu, Yang P. and Peng, Richard and Probst Gutenberg, Maximilian and Sachdeva, Sushant and Sidford, Aaron}, }