Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,888 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Cut (graph theory)
Fibonacci heap
Graph theory
Karger's algorithm
Expand
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
Dehua Cheng
,
Natali Ruchansky
2018
Corpus ID: 46992834
In this section, we expand on the details of the proposed MaxKCD algorithm for identifying k-edge-connected components, i.e. for…
Expand
2013
2013
Refinement of the Wagner-Ellis formula for the minimum radius and the Givargizov-Chernov formula for the growth rate of nanowire
V. Dubrovskii
2013
Corpus ID: 121376280
The Wagner-Ellis formula for the minimum radius of nanowire and empirical Givargizov-Chernov formula for its growth rate…
Expand
2013
2013
Analysis and Optimization of Max Flow Min-cut
Nitin Tiwari
,
Swatie Bansal
,
Abhishek Tripathi
2013
Corpus ID: 8469663
Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the…
Expand
2008
2008
A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks
F. Palmieri
,
Ugo Fiore
,
Sergio Ricciardi
Journal of Network and Systems Management
2008
Corpus ID: 3214442
Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems…
Expand