Matching large graphs, fast.

Graduate Student Seminars
Oct 4, 2016
12:30 am
Fine Hall 214

I'll talk about the graph matching problem, and go over a couple of recent (and not so recent) algorithms based on continuous relaxation to quickly match large-ish graphs.