Distributed Computation of Graph Matching in Multi-Agent Networks

20 Feb 2020 Van Tran Quoc Sun Zhiyong Anderson Brian D. O. Ahn Hyo-Sung

This work considers the distributed computation of the one-to-one vertex correspondences between two undirected and connected graphs, which is called \textit{graph matching}, over multi-agent networks. Given two \textit{isomorphic} and \textit{asymmetric} graphs, there is a unique permutation matrix that maps the vertices in one graph to the vertices in the other... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • OPTIMIZATION AND CONTROL