Description: Bipartite graph matching algorithm is optimal for each vertex by a reference to the right to seek the maximum matching problem and minimize the perfect matching problem
To Search:
File list (Check if you may need any files):
dichotomy.tar