maximum flow problem
computational problem in graph theory
Facts
4 properties- Part of
- graph theory[4]
- Has use
- flow network[5]
- Facet of
- graph theory, operations research, flow[6][7][8]
🏷️ Also known as
en max flow
en maximum flow problem
en maximum-flow problem
ar مسألة التدفق الأقصى
de Maximaler-Fluss-Problem
de Netzflussproblem
de Flussmaximierungsproblem
de Fluss-Maximierungsproblem
de Flussproblem
de Max-Flussproblem
fa مسئله بیشینه جریان
fa مسئلهٔ بیشینهٔ جریان
fr problème de flot maximum
fr flot admissible
fr problème de flot maximal
fr probleme de flot maximum
hu maximális folyam
hu maximális folyam-probléma
it problema del flusso massimo
ja 最大フロー問題
🔖 Identifiers · 4
- OpenAlex ID
- C157469704
- Dictionary of Algorithms and Data Structures ID
- maximumflow
- Freebase ID
- /m/024354
- Microsoft Academic ID (discontinued)
- 157469704
🔗 Connections
Facet of 3
Instance of 2
Has use 1
Part of 1
← Computes solution to 1
Press Enter · cited answer in seconds
0 sources
Summary
maximum flow problem is a mathematical problem[1].