1 Hit in 7.8 sec

Algorithm Engineering for Cut Problems [article]

Alexander Noe
2021 arXiv   pre-print
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