Live briefing
Everything about Karger's algorithm
Randomized algorithm for minimum cuts
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 David Karger and first published in 1993. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Karger's algorithmA 5-minute orientation
- Pick up a classic book: Practical algorithms in pediatric endocrinologyThe most-reprinted book on the subject
- Read the landmark paper: Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning treesCited 6 times
- Go sideways: Parallel algorithms for minimum spanning treesA closely related topic
- Go sideways: Dependent random choiceA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Practical algorithms in pediatric endocrinologyZ. Hochberg · 1999
Practical algorithms in pediatric endocrinologyZ. Hochberg · 2007
Practical Algorithms in Pediatric Hematology and Oncology (Practical Algorithms in Pediatrics)Richard H. Sills · 2003- 📕Practical Algorithms in Pediatric Endocrinology : (Practical Algorithms in Pediatrics. Series Editor: Z. Hochberg)Z. Hochberg · 2007
- 📕Practical Algorithms in Pediatric Nephrology : (Practical Algorithms in Pediatrics. Series Editor: Z. Hochberg)I. Zelikovic, I. Eisenstein · 2008
- 📕Practical Algorithms in Pediatric EndocrinologyStefano Cianfarani · 2025
- 📕Practical algorithms in pediatric gastroenterologyRon Shaoul · 2014
Practical algorithms in pediatric nephrologyI. Zelikovic, I. Eisenstein · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Parallel algorithms for minimum spanning trees In graph theory a minimum spanning tree (MST) T {\displaystyle T} of a graph G = ( V , E ) {\displaystyle G=(V,E)} with | V | = n {\displaystyle |V|=n}…
- Dependent random choice In mathematics, dependent random choice is a probabilistic technique that shows how to find a large set of vertices in a dense graph such that every small…
- Erdős–Stone theorem In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph…
- Forbidden subgraph problem In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G {\displaystyle G} , find the maximal number of edges…
- Randomized algorithm A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random…
- Expected linear time MST algorithm The expected linear time MST algorithm is a randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices…
- Graph bandwidth In graph theory, the graph bandwidth problem may be visualized as placing the vertices of a given graph at distinct integer positions along the number…
- Pseudorandom graph In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete…