Matchmaker v0.3

A collection of algorithms for finding maximum transversals or maximum matchings in bipartite graphs. The source codes contain 5 files:

Please contact with me if you find bugs. You can compile it via mex and use it with MATLAB. For more details about the jump-start routines and algorithms, please check technical reports.

If you use the codes please cite the papers