§ Maximum matchings in bipartite graphs
It turns out that the best way to do this is to simply implement Dinic's with
scaling. That seems to meet the desired Hopcroft-Karp complexity. I was quite
disappointed to learn this, since I was hoping that Hopcroft-Karp would have
new ideas.
§ References