no code implementations • 12 Feb 2021 • Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai
We present the first work-optimal polylogarithmic-depth parallel algorithm for the minimum cut problem on non-sparse graphs.
Data Structures and Algorithms
no code implementations • 10 Feb 2021 • Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai
Combining this with previous exact and approximation algorithms leads to our results.
Data Structures and Algorithms Discrete Mathematics
