For sparse graphs, the Hopcroft–Karp algorithm continues to have the best known worst-case performance, but for dense graphs () a more recent algorithm by  achieves a slightly better time bound, .
The Hopcroft–Karp algorithm continues to be the best known worst-case performer for sparse graphs. However, for dense graphs, a newer algorithm by  offers a slightly improved time complexity, .