{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:40:53Z","timestamp":1773081653116,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0653(04)00493-7","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"279-289","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Subgraph Matching with Semidefinite Programming"],"prefix":"10.1016","volume":"12","author":[{"given":"C.","family":"Schellewald","sequence":"first","affiliation":[]},{"given":"C.","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00493-7_BIB1","series-title":"Object Representation in Computer Vision, volume 994 of Lect. Not. Comp. Sci.","year":"1995"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1073\/pnas.89.1.60","article-title":"Psychophysical support for a two-dimensional view interpolation theory of object recognition","volume":"92","author":"B\u00fclthoff","year":"1992","journal-title":"Proc. Nat. Acad. Science"},{"issue":"6\/7","key":"10.1016\/S1571-0653(04)00493-7_BIB3","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/S0893-6080(05)80157-1","article-title":"A fast dynamic link matching algorithm for invariant pattern recognition","volume":"7","author":"Konen","year":"1994","journal-title":"Neural Networks"},{"issue":"8","key":"10.1016\/S1571-0653(04)00493-7_BIB4","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/34.400565","article-title":"Structural matching in computer vision using probabilistic relaxation","volume":"17","author":"Christmas","year":"1995","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell"},{"issue":"6","key":"10.1016\/S1571-0653(04)00493-7_BIB5","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","article-title":"Inexact graph matching using genetic search","volume":"30","author":"Cross","year":"1997","journal-title":"Pattern Recog"},{"issue":"5","key":"10.1016\/S1571-0653(04)00493-7_BIB6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","article-title":"A new algorithm for error-tolerant subgraph isomorphism detection","volume":"20","author":"Messmer","year":"1998","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell"},{"issue":"10","key":"10.1016\/S1571-0653(04)00493-7_BIB7","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","article-title":"Structural graph matching using the em algorithm and singular value decomposition","volume":"23","author":"Luo","year":"2001","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell"},{"issue":"11","key":"10.1016\/S1571-0653(04)00493-7_BIB8","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1109\/34.730557","article-title":"Graph-matching with a dual-step em algorithm","volume":"20","author":"Cross","year":"1998","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell"},{"issue":"11","key":"10.1016\/S1571-0653(04)00493-7_BIB9","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/34.809105","article-title":"Matching hierarchical structures using association graphs","volume":"21","author":"Pelillo","year":"1999","journal-title":"IEEE Trans., Patt. Anal. Mach. Intell"},{"issue":"l-4","key":"10.1016\/S1571-0653(04)00493-7_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/10556780108805828","article-title":"Solving quadratic assignment problems using convex quadratic programing relaxations","volume":"16","author":"Brixius","year":"2001","journal-title":"Optimization Methods and Software"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB11","series-title":"Mustererkennung 2001, volume 2191 of Lect. Notes Comp. Science","first-page":"361","article-title":"Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision","author":"Schellewald","year":"2001"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB12","unstructured":"Schellewald, C., Roth, S., Schnorr, C., Performance evaluation of a convex relaxation approach to the quadratic assignment of relational object views. Comp. Science Series, Technical Report 02\/2002, Dept. Math, and Comp. Science, University of Mannheim, Germany, Feb. 2002, submitted."},{"key":"10.1016\/S1571-0653(04)00493-7_BIB13","series-title":"Handbook of Combinatorial Optimization","first-page":"241","article-title":"The quadratic assignment problem","author":"Burkard","year":"1998"},{"issue":"1","key":"10.1016\/S1571-0653(04)00493-7_BIB14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","article-title":"Semidefmite programming","volume":"38","author":"Vandenberghe","year":"1996","journal-title":"SIAM Review"},{"issue":"4","key":"10.1016\/S1571-0653(04)00493-7_BIB15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","article-title":"A graduated assignment algorithm for graph matching","volume":"18","author":"Gold","year":"1996","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB16","article-title":"Doubly constrained network for combinatorial optimization","author":"Ishii","year":"2001","journal-title":"Neurocomputing"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB17","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S1571-0653(04)00493-7_BIB18","series-title":"Handbook of Semidefinite Programming","author":"Wolkowicz","year":"2000"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:54:25Z","timestamp":1548579265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":18,"alternative-id":["S1571065304004937"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00493-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}