{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:04:59Z","timestamp":1747580699566},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0031-3203(95)00089-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T22:39:10Z","timestamp":1051137550000},"page":"349-359","source":"Crossref","is-referenced-by-count":16,"title":["An improved algorithm for relational distance graph matching"],"prefix":"10.1016","volume":"29","author":[{"given":"L.","family":"Cinque","sequence":"first","affiliation":[]},{"given":"D.","family":"Yasuda","sequence":"additional","affiliation":[]},{"given":"L.G.","family":"Shapiro","sequence":"additional","affiliation":[]},{"given":"S.","family":"Tanimoto","sequence":"additional","affiliation":[]},{"given":"B.","family":"Allen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(95)00089-5_BIB1","series-title":"Frontiers of Pattern Recognition","first-page":"1","article-title":"Some techniques for recognizing structures in pictures","author":"Borrow","year":"1972"},{"key":"10.1016\/0031-3203(95)00089-5_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph homomorphisms","volume":"23","author":"Ullman","year":"1976","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0031-3203(95)00089-5_BIB3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","article-title":"Scene labeling by relaxaton operators","volume":"SMC-6","author":"Rosenfeld","year":"1976","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/0031-3203(95)00089-5_BIB4","series-title":"Proc. 6th Int. Joint Conf. Artif. Intell.","article-title":"Increasing tree search efficiency for constraint satisfaction problems","author":"Haralick","year":"1979"},{"key":"10.1016\/0031-3203(95)00089-5_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","article-title":"The consistent labeling problem: Part 1","volume":"PAMI-1","author":"Haralick","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(95)00089-5_BIB6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"PAMI-3","author":"Shapiro","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(95)00089-5_BIB7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","article-title":"A metric for computing relational description","volume":"PAMI-7","author":"Shapiro","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(95)00089-5_BIB8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance measure between attributed relational graphs for pattern recognition","volume":"SMC-13","author":"Sanfelieu","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/0031-3203(95)00089-5_BIB9","series-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognition","first-page":"174","article-title":"Information theoretic clustering of large structural modelbases","author":"Sengupta","year":"1993"},{"key":"10.1016\/0031-3203(95)00089-5_BIB10","first-page":"600","article-title":"Arrangements, homomorphisms, and discrete relaxation","volume":"SMC-13","author":"Haralick","year":"1976","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/0031-3203(95)00089-5_BIB11","series-title":"Proc. IEEE Workshop Comput. Architect. Mach. Percept.","first-page":"13","article-title":"A parallel algorithm for graph matching and its MasPar implementation","author":"Allen","year":"1993"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320395000895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320395000895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:01:00Z","timestamp":1556384460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320395000895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0031320395000895"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(95)00089-5","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}