A calculus of the absurd

24.3.3 Finding matchings even more efficiently in bipartite graphs