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...
| 發表在: | PLoS ONE |
|---|---|
| Main Authors: | , , , , , , , , |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Public Library of Science (PLoS)
2015-01-01
|
| 在線閱讀: | http://europepmc.org/articles/PMC4401723?pdf=render |
