A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
The edit distance in graphs: Methods, results, and generalizations
IMA Volumes in Mathematics and its Applications
The edit distance is a very simple and natural metric on the space of graphs. In the edit distance problem, we fix a hereditary property of graphs and compute the asymptotically largest edit distance of a graph from the property. This quantity is very difficult to compute directly but in many cases, it can be derived as the maximum of the edit distance function. Szemerédi's regularity lemma, stronglyregular graphs, constructions related to the Zarankiewicz problem -all these play a role in thedoi:10.1007/978-3-319-24298-9_2 fatcat:xflqhdjrmnhy3itrlha54d3zcq