It is becoming increasingly popular to represent myriad and diverse data sets
as graphs. When the labels of vertices of these graphs are unavailable, graph
matching (GM)---the process of determining which permutation assigns vertices
of one graph to those of another---is a computationally daunting problem. This
work presents an inexact strategy for GM. Specifically, we frame GM as a
quadratic assignment problem, and then relax the feasible region to its convex
hull.