Fast approximate quadratic programming for graph matching.

Fast approximate quadratic programming for graph matching.

Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valu...

Full description

Bibliographic Details
Main Authors: Joshua T Vogelstein, John M Conroy, Vince Lyzinski, Louis J Podrazik, Steven G Kratzer, Eric T Harley, Donniell E Fishkind, R Jacob Vogelstein, Carey E Priebe
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2015-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC4401723?pdf=render

Internet

http://europepmc.org/articles/PMC4401723?pdf=render

Similar Items