Fast Approximate Quadratic Programming for Large (Brain) Graph Matching

Abstract

Graph matching (GM)—the process of finding an optimal permutation of the vertices of one graph to minimize adjacency disagreements with the vertices of another—is rapidly becoming an increasingly important computational problem, arising in fields ranging from machine vision to neuroscience. Because GM is NP-hard, exact algorithms are unsuitable for today’s… (More)

Topics

7 Figures and Tables

Slides referencing similar topics