{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:41:22Z","timestamp":1725489682649},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729020"},{"type":"electronic","value":"9783540729037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72903-7_7","type":"book-chapter","created":{"date-parts":[[2007,8,19]],"date-time":"2007-08-19T22:54:03Z","timestamp":1187564043000},"page":"71-80","source":"Crossref","is-referenced-by-count":1,"title":["A Bound for Non-subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"Christian","family":"Schellewald","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a021(9), 917\u2013922 (1999)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transaction on Systems, Man and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transaction on Systems, Man and Cybernetics"},{"issue":"5","key":"7_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a020(5), 493\u2013504 (1998)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"doi-asserted-by":"crossref","unstructured":"Wang, Y.-K., Fan, K.-C., Horng, J.-T.: Genetic-based search for error-correcting graph isomorphism. IEEETSMC: IEEE Transactions on Systems, Man, and Cybernetics 27 (1997)","key":"7_CR4","DOI":"10.1109\/3477.604100"},{"key":"7_CR5","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1991","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1991)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is np-hard. J. Global Optim.\u00a01, 15\u201322 (1991)","journal-title":"J. Global Optim."},{"issue":"1","key":"7_CR7","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":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H.G. Barrow","year":"1976","unstructured":"Barrow, H.G., Burstall, R.M.: Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters\u00a04(4), 83\u201384 (1976)","journal-title":"Information Processing Letters"},{"issue":"3","key":"7_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications\u00a03(3), 1\u201327 (1999)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"7_CR10","volume-title":"Handbook of Combinatorial Optimization","author":"I. Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a04, Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"8","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Computation\u00a011(8), 1933\u20131955 (1999)","journal-title":"Neural Computation"},{"unstructured":"Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Limited and John Wiley and Sons (1981)","key":"7_CR12"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: CSDP: A C library for semidefinite programming. Optimization Methods and Software\u00a011(1), 613\u2013623 (1999)","journal-title":"Optimization Methods and Software"},{"volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Boston (2000)","key":"7_CR14"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11585978_12","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C. Schellewald","year":"2005","unstructured":"Schellewald, C., Schn\u00f6rr, C.: Probabilistic subgraph matching based on convex relaxation. In: Rangarajan, A., Vemuri, B., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol.\u00a03757, pp. 171\u2013186. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72903-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:50:18Z","timestamp":1619502618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72903-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729020","9783540729037"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72903-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}