Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

minimum cut · Vinony

EntityQ6865438· pop 7· linked from 33 articles

minimum cut

Sign in to save

a cut of a graph that is minimal

Connections

digital object identifier

cluster analysis

partition of a set

image segmentation

Max-flow min-cut theorem

maximum flow problem

spectral clustering

graph partition

Karger's algorithm

k-edge-connected graph

Categories

Graph theory objects Network flow problem

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.23

Entitydist 0.29

threshold graph

Entitydist 0.46

graph partition

Entitydist 0.50

planar separator theorem

Entitydist 0.50

forbidden graph characterization

Entitydist 0.51

vertex separator

Entitydist 0.51

graph structure theorem

Entitydist 0.51

Entitydist 0.51

Entitydist 0.51

Entitydist 0.53

Entitydist 0.53

What links here33 pages

glossary of graph theory terms

planar separator theorem

König's theorem

Max-flow min-cut theorem

Karger's algorithm

community structure

graph partition

Stoer–Wagner algorithm

satisfiability modulo theories

k-edge-connected graph