Skip to search formSkip to main contentSkip to account menu

Stoer–Wagner algorithm

Known as: Stoer Wagner Algorithm, Stoer-Wagner algorithm 
In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs. It was proposed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this section, we expand on the details of the proposed MaxKCD algorithm for identifying k-edge-connected components, i.e. for… 
2016
2016
The controlled islanding for the power system is an effective method to deal with the emergent situations caused by large… 
2013
2013
The Wagner-Ellis formula for the minimum radius of nanowire and empirical Givargizov-Chernov formula for its growth rate… 
2013
2013
Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the… 
2008
2008
Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems…