Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00278115n
Noun Concept
NL
No term available
EN
In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. Wikipedia
Relations
Sources
IS A
derandomization
NAMED AFTER
David Karger
SOLVES
EN
minimum cut

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