A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics |
scientific article |
Statements
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (English)
0 references
26 June 2014
0 references
metrics for structured data
0 references
graph mining
0 references
chemoinformatics
0 references
learning structure-activity relationships
0 references
