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… (More)
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… (More)
Is this relevant?
2014
2014
We study the problem of computing the minimum cut in a weighted distributed messagepassing networks (the CONGEST model). Let λ be… (More)
  • table 1
Is this relevant?
Review
2013
Review
2013
Aim: Pseudomonas aeruginosa (Ps. aeruginosa) considered as most important bacteria which can isolated from various kinds of… (More)
  • table 2
  • table 3
  • figure 1
Is this relevant?
Review
2008
Review
2008
Book Reviews C. Mittman (ed.): Pulmonary Emphysema and Proteolysis. Academic Press, New York 1972. XXVIII + 562 pp.; US $ 19.50… (More)
Is this relevant?
Review
2008
Review
2008
  • A. Pérez-Soler
  • 2008
Book Reviews A. Pérez-Soler: The Inflammatory and Atresia-Inducing Disease of the Liver and Bile Ducts. Monographs in Paediatrics… (More)
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… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 8
Is this relevant?