Finding Largest Common Substructures of Molecules in Quadratic Time

DOI10.1007/978-3-319-51963-0_24zbMath1444.92141arXiv1610.08739OpenAlexW2543923633WikidataQ56976920 ScholiaQ56976920MaRDI QIDQ2971143

Nils M. Kriege, Andre Droschinsky, Petra Mutzel

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

Largest Weight Common Subtree Embeddings with Distance Penalties ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
• The subgraph isomorphism problem for outerplanar graphs
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
• Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
• On Maximum Common Subgraph Problems in Series-Parallel Graphs

This page was built for publication: Finding Largest Common Substructures of Molecules in Quadratic Time