Example: marketing

# Search results with tag "Subgraph"

**Algorithms for Graph Similarity and Subgraph Matching**

www.cs.cmu.edu
**similarity** ﬂooding algorithm by Melnik et al. [14] applies in database schema matching; this algorithm solves the “matching” problem, that is, it attempts to ﬁnd the correspondence between the nodes of two given graphs. What is interesting about the paper is the way the algorithm is evaluated: humans check