Can anybody describe what the minimum flow in a graph network is please? I am not referring to the Minimum Cost Flow Problem here.
The minimum flow I believe is the opposite to the max flow of a network. The max flow seems intuitive in that you are trying to find the max flow through a network and you could use the min-cut approach.
But I cannot understand the minimum flow of a network. This is a paper that discuss the concept. I thought that the min flow of a network is 0 but obvious that has no value.