图匹配等价于最大权团问题的一个充要条件
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
摘要：
本文给出了一般图匹配问题等价于导出关联图的最大点和边权团问题的一个充要条件。这个结果的后果是三方面的：第一，条件是一般的，足以涵盖广泛的实际图匹配问题;第二，证明建立图匹配和团搜索之间的等价性减少到显示一个给定的图匹配问题满足所提出的条件;第三，结果设置场景的通用连续解决方案的广泛的图匹配问题。为了说明数学框架，我们将其应用到一些图匹配问题，包括确定图编辑距离的问题。
英文摘要：
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between graph matching and clique search reduces to showing that a given graph matching problem satisfies the proposed condition; and third, the result sets the scene for generic continuous solutions for a broad range of graph matching problems. To illustrate the mathematical framework, we apply it to a number of graph matching problems, including the problem of determining the graph edit distance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
