Graph Matching

Pair vertices so no vertex is used twice — maximum bipartite matching via flows or Hopcroft-Karp.

Expert

Assign students to projects, tasks to machines.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)