Abstract
This paper considers a new variant of maximum network flow problem, which has a constraint that each unit of network flow has to visit a specified node called a check node on the way from source to sink. For this problem an efficient algorithm is given which is an improved version of Hu's two-commodity flow algorithm. Moreover this paper discusses the applicability of this type of algorithm to the problem where the check node only has a positive gain.
