Assonance and dissonance between maximum flow algorithm

By identifying an algorithm with the set of its implementations, it is possible to carry out an operational comparison between two algorithms by applying a suitable operational comparison between their implementations. As a result, the paper can find out that some algorithms, apparently very different, are actually very similar. In this work the authors depned a methodology to measure the operational likeness between algorithms by introducing α-generalizability relations. These relations gave a new perspective to look at many flow algorithms, and led to the definition of the relation graph. In the first section the author describes the relation graph, in the second one he proposes a procedure in the α-generalizability relation with all the most max flow algorithms. This procedure can be viewed as the ‘trait d’union’ of these algorithms.