(Probably) Concave Graph Matching
–Neural Information Processing Systems
From acomputational point of view,this problem is equivalent to the quadratic assignment problem, and as such is an NP-hard problem (Burkard et al., 1998).
Neural Information Processing Systems
Feb-15-2026, 03:50:11 GMT