Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Hopcroft–Karp algorithm · Vinony

🌐English

English Deutsch Français Italiano Português Русский العربية فارسی ไทย 中文日本語

EntityQ1516988· pop 12· linked from 16 articles

Hopcroft–Karp algorithm

algorithm for maximum cardinality matching in bipartite graphs

Available in 12 languages

Français
Deutsch
中文
Русский
Português
العربية
Armenian
Serbian
Ukrainian

Connections

Best, worst and average case

maximum flow problem

Categories

Graph algorithms Matching (graph theory)

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

dense graph

Entity

computer science

International Standard Book Number

digital object identifier

International Standard Serial Number

depth-first search

breadth-first search

Richard M. Karp

symmetric difference

bipartite graph

time complexity

Sign in to save

What links here16 pages

3-dimensional matching

König's theorem

Dinic's algorithm

bipartite graph

John Edward Hopcroft

Richard M. Karp

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.39

Gale–Shapley algorithm

Entitydist 0.42

Entitydist 0.51

Hungarian algorithm

Entitydist 0.56

Rabin–Karp algorithm

Entitydist 0.58

diamond-square algorithm

Entitydist 0.58

De Bruijn–Erdős theorem

Entitydist 0.63

stable sorting algorithm

Entitydist 0.63

harmonious coloring

Entitydist 0.63

Tomasulo algorithm

Entitydist 0.64

Correspondence Chess Olympiad

Entitydist 0.65

Entitydist 0.66