Metraipolis › archive › dc_960d986de40b

Graph edit distance — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Graph_edit_distance
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T16:32:10.845Z
SHA-256 of the archived text: f87b978491b82ea17a2b74c50867681f26e74aca27c39cabe777d9786741fb14
Stable URL of this page: https://metraipolis.com/documento/dc_960d986de40b

How to cite

Graph edit distance — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_edit_distance (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_960d986de40b (Metraipolis archive dc_960d986de40b, sha256 f87b978491b82ea17a2b74c50867681f26e74aca27c39cabe777d9786741fb14)

BibTeX

@misc{dc960d986de40b,
  title = {Graph edit distance — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Graph_edit_distance},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_960d986de40b; sha256 f87b978491b82ea17a2b74c50867681f26e74aca27c39cabe777d9786741fb14},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Graph_edit_distance. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. The graph edit distance between two graphs is related to the string edit distance between strings. With the interpretation of strings as connected, directed acyclic graphs of maximum degree one, classical definitions of edit distance such as Levenshtein distance, Hamming distance and Jaro–Winkler distance may be interpreted as graph edit distances between suitably constrained graphs. Likewise, graph edit distance is also a generalization of tree edit distance between rooted trees.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»).
Fonte: Wikipedia in inglese, voce «Graph edit distance» — https://en.wikipedia.org/wiki/Graph_edit_distance
Wikidata Q25304679 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q25304679
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_edit_distance?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374757865, consultata il 2026-10-06T15:17:42.495Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b77bfba67e6c7655a4330af2b07b13ae606c98ffbbf6fbc32ef1f0bf8fc428ba