Pseudodeterministic Algorithms for Minimum Cut Problems
Data Structures and Algorithms
2025-12-30 v1 Computational Complexity
Abstract
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.
Cite
@article{arxiv.2512.23468,
title = {Pseudodeterministic Algorithms for Minimum Cut Problems},
author = {Aryan Agarwala and Nithin Varma},
journal= {arXiv preprint arXiv:2512.23468},
year = {2025}
}
Comments
Accepted to ITCS 2026