Login / Signup
On the Approximability of the Maximum Common Subgraph Problem.
Viggo Kann
Published in:
STACS (1992)
Keyphrases
</>
maximum common subgraph
subgraph isomorphism
approximation algorithms
graph databases
graph clustering
similarity measure
nearest neighbor
graph matching
search algorithm
pattern recognition
multi dimensional
social network analysis
point sets
pattern discovery