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)

Related topics

Related topics

7 relations
Cut (graph theory)Fibonacci heapGraph theoryKarger's algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Matrix completability analysis via graph k-connectivity A Details on the MaxKCD algorithm
In this section, we expand on the details of the proposed MaxKCD algorithm for identifying k-edge-connected components, i.e. for… 
2016
2016
Two-stage controlled islanding strategy based on Stoer-Wagner and improved Dinic algorithms
The controlled islanding for the power system is an effective method to deal with the emergent situations caused by large… 
2013
2013
Refinement of the Wagner-Ellis formula for the minimum radius and the Givargizov-Chernov formula for the growth rate of nanowire
The Wagner-Ellis formula for the minimum radius of nanowire and empirical Givargizov-Chernov formula for its growth rate… 
2013
2013
Analysis and Optimization of Max Flow Min-cut
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
A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks
Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)