Login / Signup
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics.
Leander Schietgat
Jan Ramon
Maurice Bruynooghe
Published in:
Ann. Math. Artif. Intell. (2013)
Keyphrases
</>
graph isomorphism
maximum common subgraph
k means
subgraph isomorphism
np hard
graph structure
graph mining
planar graphs
search space
structured data
search algorithm
multi dimensional
matching algorithm
undirected graph
subgraph mining