{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:15:47Z","timestamp":1767705347784},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540302872"},{"type":"electronic","value":"9783540320982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11585978_12","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:41:17Z","timestamp":1129628477000},"page":"171-186","source":"Crossref","is-referenced-by-count":91,"title":["Probabilistic Subgraph Matching Based on Convex Relaxation"],"prefix":"10.1007","author":[{"given":"Christian","family":"Schellewald","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","first-page":"377","volume":"6","author":"H.G. Barrow","year":"1971","unstructured":"Barrow, H.G., Popplestone, R.J.: Relational descriptions in picture processing. Machine Intelligence\u00a06, 377\u2013396 (1971)","journal-title":"Machine Intelligence"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of the ACM"},{"issue":"6","key":"12_CR3","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A.D.J. Cross","year":"1997","unstructured":"Cross, A.D.J., Wilson, R.C., Hancock, E.R.: Inexact graph matching using genetic search. Pattern Recog.\u00a030(6), 953\u2013970 (1997)","journal-title":"Pattern Recog."},{"issue":"5","key":"12_CR4","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"issue":"10","key":"12_CR5","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a023(10), 1120\u20131136 (2001)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"issue":"11","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1109\/34.730557","volume":"20","author":"A.D.J. Cross","year":"1998","unstructured":"Cross, A.D.J., Hancock, E.R.: Graph matching with a dual-step em algorithm. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a020(11), 1236\u20131253 (1998)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and hierarchical clustering. In: Proc. ICCV 2003 - 9th IEEE International Conference on Computer Vision, vol.\u00a01, pp. 362\u2013369 (2003)","DOI":"10.1109\/ICCV.2003.1238367"},{"issue":"9","key":"12_CR8","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1016\/S0031-3203(03)00009-8","volume":"36","author":"B.J. Wyk Van","year":"2003","unstructured":"Van Wyk, B.J., Van Wyk, M.A.: Kronecker product graph matching. Patt.\u00a0Recognition\u00a036(9), 2019\u20132030 (2003)","journal-title":"Patt.\u00a0Recognition"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-44935-3_2","volume-title":"Scale Space Methods in Computer Vision","author":"M.F. Demirci","year":"2003","unstructured":"Demirci, M.F., Shoukoufandeh, A., Keselman, Y., Dickinson, S., Bretzner, L.: Many-to-many matching of scale-space feature hierarchies using metric embedding. In: Griffin, L.D., Lillholm, M. (eds.) Scale-Space 2003. LNCS, vol.\u00a02695, pp. 17\u201332. Springer, Heidelberg (2003)"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelley","year":"2005","unstructured":"Robles-Kelley, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.patrec.2004.10.022","volume":"26","author":"T. Caelli","year":"2005","unstructured":"Caelli, T., Caetano, T.S.: Graphical models for graph matching: Approximate models and optimal algorithms. Patt.\u00a0Recog.\u00a0Letters\u00a026(3), 339\u2013346 (2005)","journal-title":"Patt.\u00a0Recog.\u00a0Letters"},{"issue":"3","key":"12_CR12","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0925-2312(01)00343-5","volume":"43","author":"S. Ishii","year":"2002","unstructured":"Ishii, S., Sato, M.: Doubly constrained network for combinatorial optimization. Neurocomputing\u00a043, 239\u2013257 (2002)","journal-title":"Neurocomputing"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0893-6080(94)90081-7","volume":"7","author":"J.J. Kosowsky","year":"1994","unstructured":"Kosowsky, J.J., Yuille, A.L.: The invisible hand algorithm: Solving the assignment problem with statistical pyhysics. Neural Networks\u00a07(3), 477\u2013490 (1994)","journal-title":"Neural Networks"},{"issue":"6","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1162\/089976699300016313","volume":"11","author":"A. Rangarajan","year":"1999","unstructured":"Rangarajan, A., Yuille, A., Mjolsness, E.: Convergence properties of the softassign quadratic assignment algorithm. Neural Computation\u00a011(6), 1455\u20131474 (1999)","journal-title":"Neural Computation"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization\u00a05(1), 13\u201351 (1995)","journal-title":"SIAM Journal on Optimization"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for 0-1 quadratic programming. Journal of Global Optimization\u00a0(7), 51\u201373 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q. Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J.\u00a0Combinat.\u00a0Optimization\u00a02(1), 71\u2013109 (1998)","journal-title":"J.\u00a0Combinat.\u00a0Optimization"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/PL00011402","volume":"89","author":"K.M. Anstreicher","year":"2001","unstructured":"Anstreicher, K.M., Brixius, N.W.: A new bound for the quadratic assignment problem based on convex quadratic programming. Mathematical Programming\u00a089(3), 341\u2013357 (2001)","journal-title":"Mathematical Programming"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB-A Quadratic Assignment Problem Library. European Journal of Operational Research\u00a055, 115\u2013119 (1991)","journal-title":"European Journal of Operational Research"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-45404-7_48","volume-title":"Pattern Recognition","author":"C. Schellewald","year":"2001","unstructured":"Schellewald, C., Roth, S., Schn\u00f6rr, C.: Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision. In: Radig, B., Florczyk, S. (eds.) DAGM 2001. LNCS, vol.\u00a02191, pp. 361\u2013368. Springer, Heidelberg (2001)"},{"issue":"11","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1109\/TPAMI.2003.1240111","volume":"25","author":"J. Keuchel","year":"2003","unstructured":"Keuchel, J., Schn\u00f6rr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a025(11), 1364\u20131379 (2003)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-28649-3_15","volume-title":"Pattern Recognition","author":"J. Keuchel","year":"2004","unstructured":"Keuchel, J., Heiler, M., Schn\u00f6rr, C.: Hierarchical image segmentation based on semidefinite programming. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol.\u00a03175, pp. 120\u2013128. Springer, Heidelberg (2004)"},{"key":"12_CR25","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)"},{"key":"12_CR26","volume-title":"Algorithms and Combinatorics","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. In: Algorithms and Combinatorics, vol.\u00a021. Springer, Heidelberg (2000)"},{"volume-title":"Handbook of Semidefinite Programming","year":"2000","key":"12_CR27","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Acad. Publ., Boston (2000)"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1090\/S0025-5718-1977-0455338-4","volume":"31","author":"P.L. Toint","year":"1977","unstructured":"Toint, P.L.: On sparse and symmetric matrix updating subject to a linear equation. Mathematics of Computation\u00a031, 954\u2013961 (1977)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y. Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. International Journal of Computer Vision\u00a040(2), 99\u2013121 (2000)","journal-title":"International Journal of Computer Vision"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11585978_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:46:53Z","timestamp":1619506013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11585978_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540302872","9783540320982"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11585978_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}