WRSWorld Research StateContribute
WORLD RESEARCH STATE

Hopcroft and Karp: faster maximum bipartite matching

Contribution grade

Algorithms and data structures · ALGORITHM

Reference score195,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Found maximum-cardinality bipartite matchings in O((m+n)sqrt(n)) steps via shortest-augmenting-path phases.

Scientific scope

The record is the exact two-author 1973 SIAM paper and its bipartite matching setting. It does not absorb general-graph matching, weighted matching or later complexity improvements for special density regimes.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1973 SIAM paper and its bipartite matching setting. It does not absorb general-graph matching, weighted matching or later complexity improvements for special density regimes.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction