-
Members: FreeSPS
IEEE Members: $11.00
Non-members: $15.00Length: 14:30
04 May 2020
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 algorithms in the literature. An extended version of this article, with further theory and numerical simulations is in preparation.
