A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree.

Tatsuya Akutsu Takeyuki Tamura

Published in: MFCS (2012)

Keyphrases

graph isomorphism
maximum common subgraph
computational complexity
subgraph isomorphism
planar graphs
k means
graph theoretic
dynamic programming
tree structure
matching algorithm
graph databases
subgraph mining
optimal solution
search space
graph mining