OurBigBook About$ Donate
 Sign in Sign up

Stoer–Wagner algorithm

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Graph algorithms
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook