Efficient structure similarity searches: a partition-based approach
Graphs are widely used to model complex data in many applications, such as bioinformatics,
chemistry, social networks, pattern recognition. A fundamental and critical query primitive is …
chemistry, social networks, pattern recognition. A fundamental and critical query primitive is …
Metric indexing for graph similarity search
Finding the graphs that are most similar to a query graph in a large database is a common
task with various applications. A widely-used similarity measure is the graph edit distance …
task with various applications. A widely-used similarity measure is the graph edit distance …
A novel edge-centric approach for graph edit similarity computation
Graph similarity is an important notion with many applications. Graph edit distance is one of
the most flexible graph similarity measures available. The main problem with this measure is …
the most flexible graph similarity measures available. The main problem with this measure is …
A novel hierarchical-based framework for upper bound computation of graph edit distance
Graph similarity is an important notion with many applications. Graph edit distance is one of
the most flexible graph similarity measure available. The main problem with this measure is …
the most flexible graph similarity measure available. The main problem with this measure is …
[PDF][PDF] Metric Indexing for Graph Similarity Search
E Schubert, NM Kriege - sisap.org
Finding the graphs that are most similar to a query graph in a large database is a common
task with various applications. A widelyused similarity measure is the graph edit distance …
task with various applications. A widelyused similarity measure is the graph edit distance …