%0 Conference Paper %1 conf/focs/0006PS21 %A Li, Jason %A Panigrahi, Debmalya %A Saranurak, Thatchaphol %B FOCS %D 2021 %I IEEE %K dblp %P 1124-1134 %T A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. %U http://dblp.uni-trier.de/db/conf/focs/focs2021.html#0006PS21 %@ 978-1-6654-2055-6

@inproceedings{conf/focs/0006PS21, added-at = {2023-11-12T00:00:00.000+0100}, author = {Li, Jason and Panigrahi, Debmalya and Saranurak, Thatchaphol}, biburl = {https://www.bibsonomy.org/bibtex/2b4db2df417985a4eea7a7f211b86ce51/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2021}, ee = {https://doi.org/10.1109/FOCS52979.2021.00111}, interhash = {b66cebccc59243c09f78a7b242e1d579}, intrahash = {b4db2df417985a4eea7a7f211b86ce51}, isbn = {978-1-6654-2055-6}, keywords = {dblp}, pages = {1124-1134}, publisher = {IEEE}, timestamp = {2024-04-09T13:25:10.000+0200}, title = {A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2021.html#0006PS21}, year = 2021 }