computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs. The concept of graph edit distance was first formalized...

In computational linguistics and computer science, edit distance is a string metric, i.e. a way of quantifying how dissimilar two strings (e.g., words)...

two graphs and methods that formulate graph matching as an optimization problem. Graph edit distance is one of similarity measures suggested for graph matching...

contraction, etc. The graph edit distance between a pair of graphs is the minimum number of elementary operations required to transform one graph into the other...

an appropriate graph. Graph edit distance is a measure of dissimilarity between two graphs, defined as the minimal number of graph edit operations required...

statistical distance between probability distributions or edit distance between strings of text) or a degree of separation (as exemplified by distance between...

electronic decelerator, a device for administering electric shocks Graph edit distance, in mathematics This disambiguation page lists articles associated...

coloring edge connectivity edge crossing edge-weighted graph edit distance edit operation edit script 8 queens elastic-bucket trie element uniqueness...

the other, i.e. their edit distance. However, the edit distance does not identify random graphs as similar; in fact, two graphs drawn independently from...

mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...