The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.
Explore Research Products in the PAR It may take a few hours for recently added research products to appear in PAR search results.
Agarwal, Arpit Agarwal, Khanna, Sanjeev, Li, Huan, Patil, Prathamesh, Wang, Chen, White, Nathan, and Zhong, Pelin. Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. Retrieved from https://par.nsf.gov/biblio/10523169.
Agarwal, Arpit Agarwal, Khanna, Sanjeev, Li, Huan, Patil, Prathamesh, Wang, Chen, White, Nathan, and Zhong, Pelin.
"Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth". Country unknown/Code not available: SIAM. https://par.nsf.gov/biblio/10523169.
@article{osti_10523169,
place = {Country unknown/Code not available},
title = {Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth},
url = {https://par.nsf.gov/biblio/10523169},
abstractNote = {},
journal = {},
publisher = {SIAM},
author = {Agarwal, Arpit Agarwal and Khanna, Sanjeev and Li, Huan and Patil, Prathamesh and Wang, Chen and White, Nathan and Zhong, Pelin},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.