Jump to content

Karger's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Luc4~enwiki (talk | contribs) at 21:16, 29 May 2007 (←Created page with 'In computer science and graph theory the '''Karger's algorithm''' is a monte carlo method to compute the minimum cut of a connected [[graph_(mathema...'). 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)

In computer science and graph theory the Karger's algorithm is a monte carlo method to compute the minimum cut of a connected graph.

This article is a stub. You can help Wikipedia by expanding it.

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