A calculus of the absurd

24.3.2 Efficiently finding matchings in bipartite graphs