Bipartite Graph Matching Task

From GM-RKB

Jump to navigation Jump to search

A Bipartite Graph Matching Task is a graph matching task whose input is a bipartite graph.

- …
Example(s):
- a Maximal Bipartite Matching Task.
- a Maximum Bipartite Matching Task.
See: Weighted Bipartite Graph Matching Task.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Bipartite_Graph_Matching_Task&oldid=779747"

Concept