Belief Propagation for Generalized B-Matching

based on the paper (please cite it if you use this code):
Loopy Belief Propagation for Bipartite Maximum Weight b-Matching
Bert Huang and Tony Jebara, in Artificial Intelligence and Statistics, 2007

The following is code for academic purposes only along with some documentation for b-matching as well as bd-matching using max-product belief propagation. The code is in C, but I include 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, 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.

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