A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

Open in new window