(Probably) Concave Graph Matching

Haggai Maron, Yaron Lipman

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).

Similar Docs  Excel Report  more

TitleSimilaritySource
None found