Subgraph Matching with Semidefinite Programming

DOI10.1016/S1571-0653(04)00493-7zbMath1173.68690OpenAlexW1988295289MaRDI QIDQ3438926

Christian Schellewald, Christoph Schnörr

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00493-7

zbMATH Keywords

semidefinite programmingcombinatorial optimizationobject recognitionsubgraph matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (2)

Image clustering based on sparse patch alignment framework ⋮ Simultaneous camera pose and correspondence estimation with motion coherence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast dynamic link matching algorithm for invariant pattern recognition
• Object representation in computer vision. International NSF-ARPA Workshop, New York City, NY, USA, December 5-7, 1994. Proceedings
• Solving quadratic assignment problems using convex quadratic programming relaxations
• Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Subgraph Matching with Semidefinite Programming