Deterministic Global Minimum Cut Using $\tilde{O}(n^{3/2})$ Cut Queries
A simple deterministic algorithm is given that finds a global minimum cut using $\tilde O(\min\left\{ n\delta,n^2/\delta \right\})$ cut queries, which equals $\tilde{O}(n^{3/2})$ in the worst case, where $\delta$ is the minimum degree of the graph.