We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n^2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic.
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter
在图中,匹配割是匹配的边割。匹配割是判定给定图是否有匹配割的问题,即使仅限于二分图,也是NP完全的。证明了直径为2的图的匹配割是多项式可解的。本文证明了对任意固定的整数$d\ge 3$,匹配割在直径为$d$的图类中是NP-完全的.这解决了Borowiecki和Jesse-Józefczyk在[Matching cutsets in graphs of diameter $2$,Theoretical计算机科学407(2008)574-582]中提出的公开问题。然后,我们表明,对于任何固定的整数$d\ge 4$,匹配割是NP-完全的,即使限制在类的二部图的直径$d$。作为对硬度结果的补充,我们证明了匹配割在直径不超过3的二部图类中是多项式时间可解的,并提出了一种新的求解直径为$2$的图类中匹配割的简单多项式时间算法.