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

Descripción completa

Detalles Bibliográficos
Autores principales: Vogelstein, Joshua T., Conroy, John M., Lyzinski, Vince, Podrazik, Louis J., Kratzer, Steven G., Harley, Eric T., Fishkind, Donniell E., Vogelstein, R. Jacob, Priebe, Carey E.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2015
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4401723/
https://www.ncbi.nlm.nih.gov/pubmed/25886624
http://dx.doi.org/10.1371/journal.pone.0121002

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4401723/
https://www.ncbi.nlm.nih.gov/pubmed/25886624
http://dx.doi.org/10.1371/journal.pone.0121002

Ejemplares similares