BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs.

José Soares Marco Aurelio Stefanes

Published in: SBAC-PAD (2003)

Keyphrases

maximum matching
bipartite graph
stable set
computational complexity
learning algorithm
np hard
matching algorithm
minimum weight
search space
k means
machine learning
convex hull
linear programming
graph clustering
randomly generated
random walk
feature space
objective function
information retrieval