The graph edit distance (GED) is a well-established distance measure widely used in many
applications, such as bioinformatics, data mining, pattern recognition, and graph …

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 …

Graph edit distance is usually used for graph similarity checking due to its low information
loss and flexibility advantages. However, graph edit distance can't be used efficiently …

This survey article considers index structures for fast similarity search for objects
represented by trees and graphs. Edit distance is used as a measure of similarity. The …

Over the last decade, graphs have gained in popularity and have been widely used to model
complex real world structures and data in various application domains. This leads to a rapid …

Similarity calculation of large-scale graphs is essential in big data classification, sorting, and
other work. However, when there are diverse attributes and the vertices are not ordered, the …

Дан обзор индексных структур для быстрого поиска по сходству объектов,
представленных деревьями и графами. В качестве меры сходства использовано …

This survey article considers index structures for fast similarity search for objects
represented by trees and graphs. The edit distance is used as a measure of similarity. The …