Spectral matching of bipartite graphs
S. Srinivasan · Hybrid Intelligent Systems · 2003
Bipartite graph matching arises in several applications including computer vision. This step is computationally expensive. Fast algorithms for this task are desirable. In this paper, we provide a random walk interpretation of bipartiate graph matching and propose three spectral algorithms for matching. The simulation results show that special algorithms provide approximate solutions fast.