Description: In seeking bipartite graph fewest points, so that each edge and at least one associated point, which is the bipartite graph of the minimum vertex cover. Bipartite graph of the minimum vertex cover number = maximum number of matches bipartite graph.
To Search:
File list (Check if you may need any files):
experience.exe
experience.cpp
Download