Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Karger's algorithm

Known as: Karger's Randomize Min-Cut Algorithm, Karger’s algorithm 
In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. It was invented by… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Beslenme desteği kritik yetişkin hastaların bakımında önemlidir. Fakat kritik hasta için uygun kalori hedefi net değildir… Expand
Is this relevant?
2014
2014
We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let… Expand
  • table 1
Is this relevant?
Review
2008
Review
2008
Book Reviews A. Pérez-Soler: The Inflammatory and Atresia-Inducing Disease of the Liver and Bile Ducts. Monographs in Paediatrics… Expand
Is this relevant?
2007
2007
ncinaria species are worms belonging to the hookworms group, and infect many animal species in various parts of the world. Human… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
2002
2002
In this paper it will be shown that a double-planar platform mechanism is archititecturally mobile if it is shaky (singular) in… Expand
Is this relevant?
1968
1968
1. BÜRGER, M., Angiopathia diabetica, Georg Thieme· Verlag, Dtsch. Ges. f. Kreislforsch., 30. Tgg., 153 (1964). — 13. HAUSS… Expand
Is this relevant?