{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:07:39Z","timestamp":1744211259839},"reference-count":44,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0166-218x(88)90005-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"45-63","source":"Crossref","is-referenced-by-count":4,"title":["Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery"],"prefix":"10.1016","volume":"19","author":[{"given":"Joseph D","family":"Benstock","sequence":"first","affiliation":[]},{"given":"Donald J","family":"Berndt","sequence":"additional","affiliation":[]},{"given":"Krishna K","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90005-4_BIB1","series-title":"Ph.D. Thesis","article-title":"Graph transformation and canonization algorithms","author":"Agarwal","year":"1976"},{"key":"10.1016\/0166-218X(88)90005-4_BIB2","series-title":"NSF Report","article-title":"Subgraph identification using associative techniques with applications to information science and chemical structure investigation","author":"Agarwal","year":"1982"},{"key":"10.1016\/0166-218X(88)90005-4_BIB3","series-title":"The Design and Analysis of Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(88)90005-4_BIB4","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0166-218X(88)90005-4_BIB5","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0166-218X(88)90005-4_BIB6","series-title":"Artificial Intelligence: A Theoretical Approach","author":"Banerji","year":"1980"},{"key":"10.1016\/0166-218X(88)90005-4_BIB7","series-title":"The Handbook of Artificial Intelligence","year":"1982"},{"key":"10.1016\/0166-218X(88)90005-4_BIB8","series-title":"Frontiers of Pattern Recognition","first-page":"1","article-title":"Some techniques for recognizing structures in pictures","author":"Barrow","year":"1972"},{"key":"10.1016\/0166-218X(88)90005-4_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0004-3702(85)90054-2","article-title":"Processing of semantic nets on dataflow architectures","volume":"27","author":"Bic","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0166-218X(88)90005-4_BIB10","series-title":"Ph.D. Thesis","article-title":"Heuristic search guidance in SYNCHEM2","author":"Boivie","year":"1977"},{"key":"10.1016\/0166-218X(88)90005-4_BIB11","series-title":"Pattern Recognition and Artificial Intelligence","first-page":"29","article-title":"Some multidimensional grammar inference methods","author":"Brayer","year":"1976"},{"key":"10.1016\/0166-218X(88)90005-4_BIB12","series-title":"Formal Theories of the Common Sense World","first-page":"405","article-title":"Metaphor and common sense reasoning","author":"Carbonell","year":"1985"},{"key":"10.1016\/0166-218X(88)90005-4_BIB13","article-title":"Computer representation of the stereochemistry of organic molecules","volume":"23","author":"Davis","year":"1976"},{"key":"10.1016\/0166-218X(88)90005-4_BIB14","series-title":"Graph-Grammars and Their Application to Computer Science","volume":"Vol. 153","year":"1983"},{"key":"10.1016\/0166-218X(88)90005-4_BIB15","series-title":"Associative Networks: The Representation and Use of Knowledge by Computers","year":"1979"},{"key":"10.1016\/0166-218X(88)90005-4_BIB16","series-title":"Pattern Recognition and Artificial Intelligence","first-page":"248","article-title":"Structural isomorphism of picture graphs","author":"Freuder","year":"1976"},{"key":"10.1016\/0166-218X(88)90005-4_BIB17","series-title":"Syntactic Methods in Pattern Recognition","author":"Fu","year":"1974"},{"key":"10.1016\/0166-218X(88)90005-4_BIB18","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(88)90005-4_BIB19","first-page":"114","article-title":"The discovery of organic synthesis routes by computer","volume":"41","author":"Gelernter","year":"1973"},{"key":"10.1016\/0166-218X(88)90005-4_BIB20","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1126\/science.197.4308.1041","article-title":"Empirical exploration of SYNCHEM","volume":"197","author":"Gelernter","year":"1977","journal-title":"Science"},{"key":"10.1016\/0166-218X(88)90005-4_BIB21","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0166-218X(88)90005-4_BIB22","series-title":"Artificial Intelligence","author":"Hunt","year":"1975"},{"issue":"4","key":"10.1016\/0166-218X(88)90005-4_BIB23","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/322092.322097","article-title":"Lower bounds for selection in X + Y and other multisets","volume":"25","author":"Johnson","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(88)90005-4_BIB24","series-title":"Tech. Report No. 82\/038","article-title":"The organization and design of SYNCHEM2","author":"Jones","year":"1982"},{"key":"10.1016\/0166-218X(88)90005-4_BIB25","article-title":"Group-Theoretic Algorithms and Graph Isomorphism","volume":"136","author":"Hoffmann","year":"1982"},{"key":"10.1016\/0166-218X(88)90005-4_BIB26","series-title":"Ph.D. Thesis","article-title":"Graph embedding algorithms and their applications","author":"Lassner","year":"1981"},{"key":"10.1016\/0166-218X(88)90005-4_BIB27","first-page":"42","article-title":"Isomorphism of graphs of bounded valence can be tested in polynomial time","author":"Luks","year":"1980","journal-title":"Proceedings 21st IEEE Symp. on Foundations of Comp. Sci."},{"issue":"1\/2","key":"10.1016\/0166-218X(88)90005-4_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(83)80047-3","article-title":"Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus","volume":"56","author":"Miller","year":"1983","journal-title":"Information and Control"},{"issue":"2","key":"10.1016\/0166-218X(88)90005-4_BIB29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1021\/c160017a018","article-title":"The generation of a unique machine description for chemical structures \u2014 a technique developed at Chemical Abstracts Service","volume":"5","author":"Morgan","year":"1965","journal-title":"J. Chemical Documentation"},{"key":"10.1016\/0166-218X(88)90005-4_BIB30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0306-4379(78)90022-4","article-title":"The WELL system: a multi-user database system based on binary relationships and graph-pattern-matching","volume":"3","author":"Muntz","year":"1978","journal-title":"Information Systems"},{"key":"10.1016\/0166-218X(88)90005-4_BIB31","series-title":"Problem-solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/0166-218X(88)90005-4_BIB32","series-title":"Explorations in Cognition","author":"Norman","year":"1975"},{"key":"10.1016\/0166-218X(88)90005-4_BIB33","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1021\/bk-1977-0046.ch006","article-title":"Algorithms in the computer handling of chemical information","volume":"Vol. 46","author":"O'Korn","year":"1977","journal-title":"American Chemical Society Symposium Series"},{"issue":"1","key":"10.1016\/0166-218X(88)90005-4_BIB34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","article-title":"Linear context-free graph grammars","volume":"19","author":"Pavlidis","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(88)90005-4_BIB35","first-page":"609","article-title":"Web grammars","author":"Pfaltz","year":"1969","journal-title":"1st Proc. IJCAI"},{"key":"10.1016\/0166-218X(88)90005-4_BIB36","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\/0166-218X(88)90005-4_BIB37","article-title":"Picture automata and grammars: An annotated bibliography","volume":"2","author":"Rosenfeld","year":"1972"},{"key":"10.1016\/0166-218X(88)90005-4_BIB38","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0146-664X(78)90113-2","article-title":"Picture processing: 1977","volume":"7","author":"Rosenfeld","year":"1978","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/0166-218X(88)90005-4_BIB39","series-title":"Ph.D. Thesis","article-title":"Some applications of graph theory","author":"Sanders","year":"1976"},{"key":"10.1016\/0166-218X(88)90005-4_BIB40","series-title":"Frontiers of Pattern Recognition","first-page":"491","article-title":"Picture graphs, grammars and parsing","author":"Shaw","year":"1972"},{"issue":"2","key":"10.1016\/0166-218X(88)90005-4_BIB41","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90005-4_BIB42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1021\/bk-1977-0046.ch001","article-title":"Graph algorithms in chemical computation","volume":"Vol. 46","author":"Tarjan","year":"1977","journal-title":"American Chemical Society Symposium Series"},{"key":"10.1016\/0166-218X(88)90005-4_BIB43","series-title":"Applied Combinatorics","author":"Tucker","year":"1980"},{"key":"10.1016\/0166-218X(88)90005-4_BIB44","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comp. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:51Z","timestamp":1555120431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":44,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0166218X88900054"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90005-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}