{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T04:23:49Z","timestamp":1787718229057,"version":"build-2784847793"},"reference-count":20,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-8655(97)00179-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:15:57Z","timestamp":1027588557000},"page":"255-259","source":"Crossref","is-referenced-by-count":531,"title":["A graph distance metric based on the maximal common subgraph"],"prefix":"10.1016","volume":"19","author":[{"given":"Horst","family":"Bunke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Shearer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S0167-8655(97)00179-7_BIB1","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","article-title":"On a relation between graph edit distance and maximum common subgraph","volume":"18","author":"Bunke","year":"1997","journal-title":"Pattern Recognition Lett."},{"issue":"1","key":"10.1016\/S0167-8655(97)00179-7_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1142\/S0218001497000081","article-title":"Recent advances in graph matching","volume":"11","author":"Bunke","year":"1997","journal-title":"Internat. J. Pattern Recognition Artif. Intell."},{"issue":"3","key":"10.1016\/S0167-8655(97)00179-7_BIB3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TPAMI.1987.4767923","article-title":"Iconic indexing by 2D strings","volume":"9","author":"Chang","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"8","key":"10.1016\/S0167-8655(97)00179-7_BIB4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0167-8655(92)90094-G","article-title":"Recognizing 3-D objects by forward checking constrained tree search","volume":"13","author":"Cho","year":"1992","journal-title":"Pattern Recognition Lett."},{"issue":"8","key":"10.1016\/S0167-8655(97)00179-7_BIB5","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. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(97)00179-7_BIB6","doi-asserted-by":"crossref","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M., 1997. Subgraph transformations for the inexact matching of attributed relational graphs. In: Jolion, J.-M., Kropatsch, W. (Eds.), Preproceeding GbR'97: IAPR Workshop on Graph Based Representations, Lyon.","DOI":"10.1007\/978-3-7091-6487-7_5"},{"issue":"11","key":"10.1016\/S0167-8655(97)00179-7_BIB7","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/34.42855","article-title":"Stereo correspondence through feature grouping and maximal cliques","volume":"11","author":"Horaud","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"3","key":"10.1016\/S0167-8655(97)00179-7_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0031-3203(92)90112-V","article-title":"Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation","volume":"25","author":"Lee","year":"1992","journal-title":"Pattern Recognition"},{"issue":"1","key":"10.1016\/S0167-8655(97)00179-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218001490000022","article-title":"Translation-, rotation-, and scale invariant recognition of hand-drawn symbols in schematic diagrams","volume":"4","author":"Lee","year":"1990","journal-title":"Internat. J. Pattern Recognition Artif. Intell."},{"key":"10.1016\/S0167-8655(97)00179-7_BIB10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02575586","article-title":"A note on the derivation of maximal common subgraphs of two directed or undirected graphs","volume":"9","author":"Levi","year":"1972","journal-title":"Calcols"},{"key":"10.1016\/S0167-8655(97)00179-7_BIB11","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0898-1221(92)90125-2","article-title":"Pattern associativity and the retrieval of semantic networks","volume":"23","author":"Levinson","year":"1992","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0167-8655(97)00179-7_BIB12","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/0031-3203(91)90029-5","article-title":"Hierarchical attributed graph representation and recognition of handwritten Chinese characters","volume":"24","author":"Lu","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(97)00179-7_BIB13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","article-title":"Backtrack search algorithms and the maximal common subgraph problem","volume":"12","author":"McGregor","year":"1982","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S0167-8655(97)00179-7_BIB14","doi-asserted-by":"crossref","unstructured":"Messmer, B., Bunke, H., 1996. Automatic learning and recognition of graphical symbols in engineering drawing. In: Kasturi, R., Tombre, K. (Eds.), Graphics Recognition, Lecture Notes in Computer Science, vol. 1072. Springer, Berlin, 1996, pp. 123\u2013134.","DOI":"10.1007\/3-540-61226-2_11"},{"issue":"9","key":"10.1016\/S0167-8655(97)00179-7_BIB15","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/0031-3203(94)90007-8","article-title":"Rulegraphs for graph matching in pattern recognition","volume":"27","author":"Pearce","year":"1994","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(97)00179-7_BIB16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Read","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0167-8655(97)00179-7_BIB17","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"3","author":"Shapiro","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(97)00179-7_BIB18","doi-asserted-by":"crossref","unstructured":"Shearer, K., Bunke, H., Venkatesh, S., Kieronska, D., 1997. Efficient graph matching for video indexing. In: Jolion, J.-M., Kropatsch, W. (Eds.), Preproceeding GbR'97: IAPR Workshop on Graph based Representations, Lyon.","DOI":"10.1007\/978-3-7091-6487-7_6"},{"issue":"1","key":"10.1016\/S0167-8655(97)00179-7_BIB19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullman","year":"1976","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0167-8655(97)00179-7_BIB20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0031-3203(92)90111-U","article-title":"Model matching in robot vision by subgraph isomorphism","volume":"25","author":"Wong","year":"1992","journal-title":"Pattern Recognition"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865597001797?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865597001797?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:35:21Z","timestamp":1578479721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865597001797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167865597001797"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(97)00179-7","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}