The Stoer-Wagner algorithm finds the global minimum cut in time. It works by repeatedly finding minimum - cuts for carefully chosen and , then merging vertices. The algorithm contracts the graph by merging vertices and tracking cut weights.
After iterations, you have checked enough cuts to find the global minimum. This is the standard approach for global minimum cut in undirected graphs.
Space complexity is for the data structures used.