{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:17:15Z","timestamp":1778300235969,"version":"3.51.4"},"reference-count":47,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1016\/s0031-3203(97)00041-1","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:45:35Z","timestamp":1049510735000},"page":"205-218","source":"Crossref","is-referenced-by-count":21,"title":["A new algorithm for subgraph optimal isomorphism"],"prefix":"10.1016","volume":"31","author":[{"given":"Yasser","family":"El-Sonbaty","sequence":"first","affiliation":[]},{"given":"M.A.","family":"Ismail","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0031-3203(97)00041-1_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance between attributed relational graphs for pattern recognition","volume":"13","author":"Sanfeliu","year":"1983","journal-title":"IEEE Trans. Systems, Man Cybernet."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB2","series-title":"Graph Theory with Applications to Engineering and Computer Science","author":"Deo","year":"1995"},{"issue":"3","key":"10.1016\/S0031-3203(97)00041-1_BIB3","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/21.57275","article-title":"An algorithm for graph optimal monomorphism","volume":"20","author":"Wong","year":"1990","journal-title":"IEEE Trans. Systems, Man Cybernet."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB4","article-title":"Structural descriptions and inexact matching","author":"Shapiro","year":"1979"},{"issue":"2","key":"10.1016\/S0031-3203(97)00041-1_BIB5","article-title":"Relaxation applied to matching quantitative relational structures","volume":"10","author":"Kitchen","year":"1980","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TPAMI.1979.4766876","article-title":"Shape matching using relaxation techniques","volume":"1","author":"Davis","year":"1979","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0031-3203(92)90075-T","article-title":"Matching: invariant to translation, rotation, and scale changes","volume":"25","author":"Li","year":"1992","journal-title":"Pattern Recognition"},{"issue":"8","key":"10.1016\/S0031-3203(97)00041-1_BIB8","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 Analysis Mach. Intel."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB9","article-title":"DPA: a deterministic approach to the MAP problem","author":"Berthod","year":"1996","journal-title":"IEEE Trans. Image Process"},{"issue":"4","key":"10.1016\/S0031-3203(97)00041-1_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/TSMC.1980.4308468","article-title":"Graph optimal monomorphism algorithms","volume":"10","author":"Ghahraman","year":"1980","journal-title":"IEEE Trans. Systems, Man Cybernet"},{"issue":"1","key":"10.1016\/S0031-3203(97)00041-1_BIB11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TSMC.1983.6313029","article-title":"Subgraph error-correcting isomorphisms for syntactic pattern recognition","volume":"13","author":"Tsai","year":"1983","journal-title":"IEEE Trans. Systems, Man Cybernet"},{"issue":"5","key":"10.1016\/S0031-3203(97)00041-1_BIB12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TPAMI.1986.4767835","article-title":"An image understanding system using attributed symbolic representation and inexact graph matching","volume":"8","author":"Eshera","year":"1986","journal-title":"Pattern Analysis Mach. Intell."},{"issue":"3","key":"10.1016\/S0031-3203(97)00041-1_BIB13","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TSMC.1984.6313232","article-title":"A graph distance measure for image analysis","volume":"14","author":"Eshera","year":"1984","journal-title":"IEEE Tran. Systems, Man Cybernet"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB14","series-title":"Proc. IEEE Conf. Comput. Vision and Pattern Recognition","first-page":"417","article-title":"Object recognition using multilayer hopfield neural networks","author":"Young","year":"1994"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB15","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1109\/34.297953","article-title":"A neural networks approach to CSG-based 3D object recognition","volume":"16","author":"Chen","year":"1994","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB16","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/0031-3203(94)00166-J","article-title":"Pattern recognition by graph matching using the potts MFT neural networks","volume":"28","author":"Suganthan","year":"1995","journal-title":"Pattern Recognition"},{"issue":"4","key":"10.1016\/S0031-3203(97)00041-1_BIB17","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. Pattern Analysis Mach. Intell."},{"issue":"6","key":"10.1016\/S0031-3203(97)00041-1_BIB18","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/0031-3203(95)00140-9","article-title":"Graph matching using a direct classification of node attendance","volume":"29","author":"Depiero","year":"1996","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB19","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","article-title":"An Eigendecomposition approach to weighted graph matching problems","volume":"10","author":"Umeyama","year":"1988","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"issue":"4","key":"10.1016\/S0031-3203(97)00041-1_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/0307-904X(91)90011-D","article-title":"A polynomial transform for matching pairs of weighted graphs","volume":"15","author":"Almohamad","year":"1991","journal-title":"J. Appl. Math. Modeling"},{"issue":"5","key":"10.1016\/S0031-3203(97)00041-1_BIB21","doi-asserted-by":"crossref","DOI":"10.1109\/34.211474","article-title":"A linear programming approach for the weighted graph matching problem","volume":"15","author":"Almohamad","year":"1993","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB22","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","article-title":"Polynomial algorithm for graph isomorphism and chromatic index on partial K-trees","volume":"11","author":"Bodlaender","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB23","article-title":"A linear time algorithm for isomorphism of graphs of bounded average genus","author":"Chen","year":"1991"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(88)90037-3","article-title":"A fast backtrack algorithm for graph isomorphism","volume":"29","author":"Mittal","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB25","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","article-title":"Graph isomorphism is in the low hierarchy","volume":"37","author":"Schoning","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB26","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","author":"Read","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB27","first-page":"153","article-title":"Some Recognition Problems Related to Graph Isomorphism","author":"Timkovskii","year":"1988"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB28","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(87)90070-1","article-title":"Three dimension object recognition from single two dimension images","volume":"31","author":"Lowe","year":"1987","journal-title":"Artificial Intell."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB29","series-title":"Pattern Recognition: Statistical, Structural and Neural Approaches","author":"Schalkoff","year":"1992"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB30","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0019-9958(69)90017-5","article-title":"A formal picture description scheme or a basis for picture processing systems","volume":"14","author":"Shaw","year":"1969","journal-title":"Inform. Control."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB31","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/321592.321598","article-title":"Parsing of graph-representable pictures","volume":"Vol. 17","author":"Shaw","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB32","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0022-0000(73)80049-2","article-title":"Web grammar and several graphs","volume":"7","author":"Abe","year":"1973","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB33","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/0203007","article-title":"First order graph grammars","volume":"3","author":"Cook","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","article-title":"Linear and context-free graph grammars","volume":"19","author":"Pavlidis","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB35","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0031-3203(72)90016-7","article-title":"Representation of figures by labelled graphs","volume":"4","author":"Pavlidis","year":"1972","journal-title":"Pattern Recognition"},{"issue":"7","key":"10.1016\/S0031-3203(97)00041-1_BIB36","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/0031-3203(94)00182-L","article-title":"Theoretical aspects of syntactic pattern recognition","volume":"28","author":"Tanaka","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB37","article-title":"On distance of graphs defined by use of orthogonality between circuits and cutsets","author":"Kajitani","year":"1973"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB38","article-title":"On the metric space of labeled Graphs","author":"Kajitani","year":"1975"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB39","article-title":"A metric on graphs and its applications","author":"Tanaka","year":"1977","journal-title":"IEE Japan ip-77-55"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB40","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"12","author":"Kuhn","year":"1955","journal-title":"Naval Res. Log. Quart."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB41","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230100205","article-title":"An algorithm to solve the m\u2217n assignment problem in expected time O(mn log n)","volume":"10","author":"Karp","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB42","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","article-title":"Solving the assignment problem by relaxation","volume":"4","author":"Hung","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0031-3203(97)00041-1_BIB43","series-title":"Int. Symp. on Circuits and Systems","first-page":"284","article-title":"An efficient algorithm for planner assignment problem","author":"Yamada","year":"1987"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB44","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","article-title":"A survey of heuristics for the weighted matching problem","volume":"13","author":"Avis","year":"1983","journal-title":"Networks"},{"issue":"12","key":"10.1016\/S0031-3203(97)00041-1_BIB45","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/ecjc.4430731204","article-title":"An efficient algorithm for the linear assignment problem","volume":"73","author":"Yamada","year":"1990","journal-title":"Elect. Comm. Japan"},{"issue":"2","key":"10.1016\/S0031-3203(97)00041-1_BIB46","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0031-3203(94)00090-9","article-title":"Bipartite weighted matching for on-line handwritten chiness character recognition","volume":"28","author":"Hsieh","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(97)00041-1_BIB47","series-title":"Airports of the world","author":"Stroud","year":"1980"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397000411?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397000411?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:25:27Z","timestamp":1556385927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320397000411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0031320397000411"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(97)00041-1","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}