Congrats to Di Wang & coauthors for co-winning the SODA 2024 Best Paper Award for "Deterministic Near-Linear Time Minimum Cut in Weighted Graphs", which is a significant development since Karger's famous randomized algorithm for this problem. Learn more→ https://
goo.gle/48mXpqr

→ View original post on X — @googleai