Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited.

Published in: CoRR (2015)

Keyphrases

maximum matching
bipartite graph
special case
closely related
neural network
machine learning
learning algorithm
constraint satisfaction
graph model
graph theoretic