The edit distance in graphs: Methods, results, and generalizations

DOI10.1007/978-3-319-24298-9_2zbMath1354.05067OpenAlexW2505933724MaRDI QIDQ2957174

Ryan R. Martin

Publication date: 25 January 2017

Published in: Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24298-9_2

zbMATH Keywords

quadratic programmingedit distancecolored regularity graphs

Mathematics Subject Classification ID

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

Related Items (5)

On the edit distance function of the random graph ⋮ Obstructions for partitioning into forests and outerplanar graphs ⋮ Accumulation points of the edit distance function ⋮ Deviation estimates for Eulerian edit numbers of random graphs ⋮ The edit distance function of some graphs

This page was built for publication: The edit distance in graphs: Methods, results, and generalizations