Suppose we're given the max-flow and the corresponding residual graph, and edge capacities for an arbitrary digraph. We're also given said graph. Is there a way to check in linear time whether there exists a max-flow of at least $k$ by redistributing some of the edge capacities?
EDIT: the capacities need to stay integral