In this paper, we present efficient pseudodeterministic algorithms for both the global minimum cut and minimum s-t cut problems. The running time of our algorithm for the global minimum cut problem is asymptotically better than the fastest sequential deterministic global minimum cut algorithm (Henzinger, Li, Rao, Wang; SODA 2024). Furthermore, we implement our algorithm in sequential, streaming, PRAM, and cut-query models, where no efficient deterministic global minimum cut algorithms are known.

翻译：本文针对全局最小割与最小s-t割问题提出了高效的伪确定性算法。我们在全局最小割问题上所提算法的运行时间，渐近优于当前最快的串行确定性全局最小割算法（Henzinger, Li, Rao, Wang; SODA 2024）。此外，我们在串行、流式计算、PRAM及割查询模型中实现了该算法，而这些模型此前尚未存在高效的确定性全局最小割算法。