Jump to content

Talk:Karger's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Qwertyus (talk | contribs) at 15:08, 24 June 2012 (←Created page with 'This article need some more work. * Edge weights were mentioned once in the article; I've removed that. Weighted graphs should be discussed properly, though. * ...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Karger%27s_algorithm&oldid=499144969"