On the editing distance of graphs
From MaRDI portal
Publication:3506314
DOI10.1002/jgt.20296zbMath1156.05027arXivmath/0606475MaRDI QIDQ3506314
André E. Kézdy, Ryan R. Martin, Maria A. Axenovich
Publication date: 12 June 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606475
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C12: Distance in graphs
Related Items
Sparse graphs: Metrics and random models, The edit distance function and symmetrization, On the computation of edit distance functions, The structure of hereditary properties and 2-coloured multigraphs, On the Edit Distance from K2,t-Free Graphs, A note on the bichromatic numbers of graphs, Partitioning a Graph into Highly Connected Subgraphs, Edit distance measure for graphs, A Brooks‐Type Theorem for the Bichromatic Number, Stability‐type results for hereditary properties
Cites Work