Graph edit distance computation: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5610:56, 10 October 2022‎ Admin talk contribs‎ 1,000 bytes +1,000‎ Created page with "== Problem Description== In mathematics and 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 mathematically by Alberto Sanfeliu and King-Sun Fu in 1983. A major application of graph edit distance is in inexact graph matching, such as error-tolerant pattern recognition in machine learning == Bounds Chart == File:Graph_edit_distance_computationBoundsChart..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Graph_edit_distance_computation"