26 search results - page 6 / 6 » Nearly Tight Bounds for Testing Function Isomorphism |
130
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...