53 citations · 365 across the 52 of their papers we have counts for
6 papers · 1 filter
On the computation of edit distance functions
Ryan R. Martin
The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The edit distance function of the hereditary property,…
On the edit distance from -free graphs II: Cases
Ryan Martin, Tracy McKay
The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary propert…
On the edit distance from -free graphs (Extended Version)
Ryan R. Martin, Tracy McKay
The edit distance between two graphs on the same vertex set is defined to be the size of the symmetric difference of their edge sets. The edit distance function of a hereditary pro…
The edit distance function and symmetrization
Ryan R. Martin
The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, , and a hereditary pr…
Lower bounds for identifying codes in some infinite grids
Ryan Martin, Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…
Tiling tripartite graphs with 3-colorable graphs: The extreme case
Kirsten Hogenson, Ryan R. Martin, Yi Zhao
There is a sufficiently large such that the following holds. If is a tripartite graph with vertices in each vertex class such that every vertex is adjace…