Edit distance and its computation

zbMath1159.05030arXiv1605.05747MaRDI QIDQ1010726

József Balogh, Ryan R. Martin

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05747

zbMATH Keywords

asymptotic valuemaximum edit distanceweighted generalization of Turan's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (15)

On the edit distance function of the random graph ⋮ Accumulation points of the edit distance function ⋮ On a colored Turán problem of Diwan and Mubayi ⋮ Edit distance measure for graphs ⋮ On the Edit Distance from K2,t-Free Graphs ⋮ The edit distance function of some graphs ⋮ The edit distance function and symmetrization ⋮ The regularity of almost all edge ideals ⋮ Induced saturation number ⋮ The structure of hereditary properties and 2-coloured multigraphs ⋮ On the computation of edit distance functions ⋮ Graph distance measures based on topological indices revisited ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ On the edit distance of powers of cycles ⋮ Stability‐type results for hereditary properties

This page was built for publication: Edit distance and its computation