Talk:Karger's algorithm

Merged/Todo

I 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.

Qwertyus (talk) 15:08, 24 June 2012 (UTC)

What is cn?

What 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{}

what 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)