By Ulrich Derigs
Network stream and matching are frequently handled individually within the literature and for every classification quite a few assorted algorithms has been built. those algorithms are typically labeled as primal, twin, primal-dual and so on. The query the writer addresses during this paintings is that of the life of a standard combinatorial precept that may be inherent in all these it appears assorted ways. it's proven that each one universal community move and matching algorithms implicitly keep on with the so-called shortest augmenting direction. this is interpreted as a greedy-like determination rule the place the optimum answer is equipped up via a chain of neighborhood optimum options. The potency of this process is learned by way of combining this myopic choice rule with an anticipant association. The strategy of this paintings is equipped as follows. For numerous normal circulation and matching difficulties the typical resolution tactics are first reviewed. it really is then proven that all of them lessen to a typical easy precept, that's, all of them practice a similar computational steps if yes stipulations are set thoroughly and ties are damaged in response to a standard rule. spotting this near-equivalence of all known algorithms the query of the simplest procedure needs to be transformed - all tools are (only) various implementations of an analogous set of rules bought via diverse perspectives of the problem.