Efe Onaran

Efficient Belief Propagation for Graph Matching

In this short note we derive a novel belief propagation algorithm for graph matching and we numerically evaluate it in the context of matching random graphs. The derived algorithm has a lower asymptotic time-complexity without significantly compromising the accuracy compared to leading available alg…