Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00278115n
Noun Concept
Categories: Graph connectivity, Graph algorithms
EN
Karger's algorithm  Karger's Randomize Min-Cut Algorithm  Karger’s algorithm  Random contraction algorithm
EN
In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. Wikipedia
Definitions
Relations
Sources
EN
In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. Wikipedia
Randomized algorithm for minimum cuts Wikidata
IS A
randomized algorithm
NAMED AFTER
David Karger
SOLVES
minimum cut
Wikipedia
EN
Karger's algorithm
Wikidata
EN
Karger's algorithm
Wikipedia Redirections
EN
Karger's randomize min-cut algorithm, Karger's Randomize Min-Cut Algorithm, Karger’s algorithm, Random contraction algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License