11 search results - page 3 / 3 » Maximum common subgraph isomorphism algorithms for the match... |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...