Jisho

×
最大フロー問題
Links
Wikipedia definition
1. Maximum flow problem​In optimization theory, the maximum flow problem is to find a feasible flow through a single-source, single-sink flow network that is maximum. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.
Read “Maximum flow problem” on English Wikipedia
Read “最大フロー問題” on Japanese Wikipedia
Read “Maximum flow problem” on DBpedia

Discussions

to talk about this word.