Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery

DOI10.1016/0166-218X(88)90005-4zbMath0633.05062WikidataQ127857737 ScholiaQ127857737MaRDI QIDQ1095944

Krishna K. Agarwal, Joseph D. Benstock, Donald J. Berndt

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

expert systemGraph embeddingsubgraph isomorphismSYNCHEM2

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Chemistry (92Exx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Group-theoretic algorithms and graph isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Syntactic methods in pattern recognition
• Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
• The graph isomorphism disease
• Lower Bounds for Selection in X + Y and Other Multisets
• Linear and Context-Free Graph Grammars
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery