Talk:Karger's algorithm
Latest comment: 11 months ago by Extremmist in topic what is min{}
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Merged/Todo
editI merged the old page Karger's randomize min-cut algorithm into this page as requested, but the resulting article need some more work.
- Edge weights were mentioned once in the article; I've removed that. Weighted graphs should be discussed properly, though.
- Karger (1993) discusses a parallel version of the algorithm.
- One of the theorems isn't really one; "with high probability" isn't precise enough.
- The definition of the minimum cut problem belongs in its own article.
- The content from the other page needs copyediting.
What is cn?
editWhat does cn stand for in the formula? — Preceding unsigned comment added by 86.220.36.148 (talk) 20:07, 4 August 2012 (UTC)
what is min{}
editwhat does min{} mean in the fastmincut pseudocode?
it takes two graphs. so it is the number of edges left? number of nodes left? Extremmist (talk) 13:57, 25 December 2023 (UTC)