A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
All of these algorithms are efficient in practice and freely available for use. ... This work develops highly-efficient algorithms for the (global) minimum cut problem, the balanced graph partitioning problem and the multiterminal cut problem. ... In: Proc. of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. Ed. by S. G. Kobourov and H. Meyerhenke. ...arXiv:2108.04566v1 fatcat:4tpyybkhsvg6toiuxkvdvychqu