minimum cut
a cut of a graph that is minimal
Facts
7 properties- Instance of
- specialized term, computational problem[2]
- Has use
- flow network[5]
- Computational complexity
- P[9]
- Opposite of
- maximum cut[6]
- Studied by
- graph theory[7]
🏷️ Also known as
en mincut
en min-cut
en minimum cut
ar مسألة القص الأدنى
ar مسألة القطع الأدنى
cs minimální řez
de minimaler Schnitt
fa برش کمینه
fr coupe minimum
hu minimális vágás
it min-cut
it taglio minimo
pt corte mínimo
ru Наименьший разрез
th ส่วนตัดต่ำสุด
zh 最小割問題
🔖 Identifiers · 7
- OpenAlex ID
- C185690422
- Image (Wikimedia Commons)
- Min-cut.svg ↗
- BabelNet ID
- 02906517n
- Dictionary of Algorithms and Data Structures ID
- minimumcut
- Freebase ID
- /m/0drz184
- MathWorld ID
- Mincut
- Microsoft Academic ID (discontinued)
- 185690422
🔗 Connections
Instance of 2
← Computes solution to 2
Has use 1
Maintained by WikiProject 1
Opposite of 1
Part of 1
Studied by 1
Subclass of 1
← Opposite of 1
← Statement describes 1
Press Enter · cited answer in seconds
0 sources
Summary
minimum cut is a specialized term[1].