Live briefing
Everything about Minimum cut
Partition of a graph by removing fewest possible edges
In graph theory, a minimum cut or min-cut of a graph is a cut that is minimal in some metric. In the simplest unweighted min-cut problem, the goal is to minimize the number of edges connecting the two parts. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Minimum cutA 5-minute orientation
- Skim a recent paper: Minimum National Prevalence of Diagnosed Atrial Fibrillation Inferred From California Acute Care FacilitiesInfluential work since 2022
- Pick up a classic book: Hearing on code of fair practicesThe most-reprinted book on the subject
- Read the landmark paper: A new approach to the minimum cut problemCited 334 times
- Go sideways: Cut (graph theory)A closely related topic
- Go sideways: Karger's algorithmA closely related topic
📖 Definitions
Noun A cut that is minimal in some metric.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A new approach to the minimum cut problem
Odd Minimum Cut-Sets and b -Matchings
Graph Clustering and Minimum Cut Trees
Minimum thickness of cut in micromachining
Solving Project Scheduling Problems by Minimum Cut Computations
Inverse maximum flow and minimum cut problems
Implementing an efficient minimum capacity cut algorithm
Unifying maximum cut and minimum cut of a planar graph
🆕 Influential since 2022
Minimum National Prevalence of Diagnosed Atrial Fibrillation Inferred From California Acute Care Facilities
Wild-type distributions of minimum inhibitory concentrations and epidemiological cut-off values—laboratory and clinical utility
A comprehensive review on the viability of minimum quantity lubrication technology for machining difficult-to-cut alloys
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
A Novel Large-Scale Stochastic Pushback Design Merged with a Minimum Cut Algorithm for Open Pit Mine Production Scheduling
📚 Books worth reading
- 📕Hearing on code of fair practicesUnited States. National Recovery Administration · 1933
Data structures and algorithm analysis in CMark Allen Weiss · 1993- 📕All-service programmeGreat Britain. Civil Service National Whitley Council. (Staff Side). · 1928
- 📕MatheuristicsVittorio Maniezzo, Thomas Stützle · 2009
Cooperative control and optimizationRobert Murphey, Panos M. Pardalos · 2002
Linguistic structure predictionNoah A. Smith · 2011
Discrete mathematics with graph theoryEdgar G. Goodaire · 1998
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Cut (graph theory) In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one…
- 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 David…
- Stoer–Wagner algorithm In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights…
- Assignment problem The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has…
- Minimum spanning tree In graph theory, a minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph…
- Maximum flow problem In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum…
- Graph partition In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges…
- Network flow problem In combinatorial optimization, network flow problems are a class of computational problems in which the input is a flow network (a graph with numerical…