We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context.â€¦ (More)

In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply toâ€¦ (More)

We discuss efficient augmentation algorithms for the maximum balanced flow problem which run in O (nm ) time. More explicitly, we discuss a balanced network search procedure which finds validâ€¦ (More)

This paper discusses the balanced circulation polytope, that is, the convex hull of balanced circulations of a given balanced flow network. The LP description of this polytope is the LP descriptionâ€¦ (More)

The present paper continues our study of balanced network flows and general matching problems [6â€“9]. Beside the techniques presented in these papers, there is a further strategy to obtain maximumâ€¦ (More)

The present paper continues our study of balanced network flows and general matching problems [2, 3, 4]. Problems of finding maximum matchings, minimumdeficiency matchings, and even factors of graphsâ€¦ (More)

We discuss an adaptation of the famous primal-dual 1matching algorithm to balanced network flows which can be viewed as a network flow description of capacitated matching problems. This method isâ€¦ (More)

This paper closes some gaps in the discussion of nonweighted balanced network flow problems. These gaps all concern the phase-ordered augmentation algorithm, which can be viewed as the matchingâ€¦ (More)