A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An eigendecomposition approach to weighted graph matching problems
1988
IEEE Transactions on Pattern Analysis and Machine Intelligence
This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and directed graphs. The WGMP is the problem of finding the optimum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method employs an analytic, instead of a combinatorial or iterative, approach to the optimum matching problem of such graphs. By using the eigendecompoyitions of the adjacency matrices (in the case of the undirected graph
doi:10.1109/34.6778
fatcat:jrin4lklerd2dkxnq7xasxosp4