Belief Propagation for Generalized B-Matching

Based on the paper (please cite it if you use this code):

Bert Huang and Tony Jebara, "Loopy Belief Propagation for Bipartite Maximum Weight b-Matching," in Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics , San Juan, Puerto Rico, 2007.

The following code and documentation is intended for academic purposes. The code performs b-matching as well as bd-matching using max-product belief propagation. It is implemented in C, but includes a MATLAB version and a MATLAB interface for the C version.

This is the latest version that does bd-matching with different degree constraints on each node. It can handle both unipartite and bipartite graphs. New features include user set parameters for maximum iterations and damping. The new code operates on full graphs so it can be used as an approximation for bd-matching on unipartite graphs.

BELIEF PROPAGATION B-MATCHING CODE

More details are provided in the README file.

Finally, please read this Columbia University license file if you intend to use this software for non-academic applications.

Last modified: Fri Apr 4 16:19:39 EDT 2008