The Stoer–Wagner algorithm is a combinatorial algorithm designed to find the minimum cut of an undirected weighted graph. The minimum cut is a partition of the graph's vertices into two disjoint subsets such that the sum of the weights of the edges crossing the cut is minimized. This algorithm is particularly notable because it runs in \(O(n^3)\) time complexity, where \(n\) is the number of vertices in the graph.
Articles by others on the same topic
There are currently no matching articles.