In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative...
15 KB (2,618 words) - 22:17, 4 April 2025
one of the namesakes of the Stoer–Wagner algorithm for minimum cuts, which she published with Frank Wagner in 1994. Stoer was a master's student of Martin...
7 KB (423 words) - 16:43, 5 April 2025
deterministic algorithms for the global minimum cut problem include the Stoer–Wagner algorithm, which has a running time of O ( m n + n 2 log n ) {\displaystyle...
13 KB (2,303 words) - 17:39, 17 March 2025
solved in polynomial time by the Stoer-Wagner algorithm. In the special case when the graph is unweighted, Karger's algorithm provides an efficient randomized...
6 KB (732 words) - 17:38, 23 June 2025
The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically...
10 KB (604 words) - 22:23, 4 April 2025
textbook author Mechthild Stoer, German applied mathematician and operations researcher, namesake of Stoer-Wagner minimum cut algorithm Ruth Stokes (1890–1968)...
196 KB (23,372 words) - 23:22, 16 July 2025
CS1 maint: untitled periodical (link) Prudence, Paul. "David Wade's 'Fantastic Geometry' – The Works of Wenzel Jamnitzer & Lorenz Stoer". Dataisnature....
58 KB (5,776 words) - 12:09, 17 July 2025