On the efficiency of Egerváry ’ s perfect matching algorithm

This paper shows that the perfect matching algorithm implicitly given in Egerváry’s original work is not polynomial in itself. First we show an example with integer weights that requires exponential number of steps. Then, another example shows that — enabling real number weights — it is also possible that the algorithms fails to find an optimal solution in finite number of steps.