Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions

DOI10.1007/978-3-319-40530-8_13zbMath1344.68108arXiv1604.06379OpenAlexW2962965938WikidataQ57269509 ScholiaQ57269509MaRDI QIDQ3187812

Christoph Flamm, Daniel Merkle, Peter F. Stadler, Uffe Thorsen

Publication date: 5 September 2016

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.06379

zbMATH Keywords

integer linear programmingchemistrymaximum common edge subgraphatom-atom mappingnetwork completion

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Classical flows, reactions, etc. in chemistry (92E20) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• A survey of graph edit distance
• The maximum common edge subgraph problem: A polyhedral investigation
• A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
• Graph Transformations
• 50 Shades of Rule Composition

This page was built for publication: Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions