Algorithms for Large, Sparse Network Alignment Problems

We propose a new distributed algorithm for sparse variants of the network nalignment problem that occurs in a variety of data mining areas including nsystems biology, database matching, and computer vision. Our algorithm uses a nbelief propagation heuristic and provides near optimal solutions for an NP-hard ncombinatorial optimization problem. We show that our algorithm is fas..