We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence.
確定! 回上一頁