Talk:Karger's algorithm

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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)[reply]

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)[reply]

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)[reply]