相关论文: On the computation of edit distance functions
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, $G$, and a hereditary property, ${\cal H}$, is the minimum of the distance between…
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 property, $\mathcal{H}$, is a function of $p$, and measures,…
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 property, $\mathcal{H}$, is a function of $p$ and measures,…
The edit distance between two graphs on the same labeled vertex set is defined to be the size of the symmetric difference of the edge sets. The edit distance function of a hereditary property $\mathcal{H}$ is a function of $p\in [0,1]$ that…
The edit distance function of a hereditary property $\mathscr{H}$ is the asymptotically largest edit distance between a graph of density $p\in[0,1]$ and $\mathscr{H}$. Denote by $P_n$ and $C_n$ the path graph of order $n$ and the cycle…
In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemer\'edi's Regularity Lemma…
Given a hereditary property of graphs $\mathcal{H}$ and a $p\in [0,1]$, the edit distance function ${\rm ed}_{\mathcal{H}}(p)$ is asymptotically the maximum proportion of edge-additions plus edge-deletions applied to a graph of edge density…
An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\mathcal{G}$, the editing distance from $G$ to $\mathcal{G}$ is the smallest number…
In this paper, we establish that the maximum edit distance of an $n$-vertex graph from the hereditary property of word-representable graphs is $n^2/8-o(n^2)$. In addition, we establish that the maximum edit distance of an $n$-vertex graph…
Given a hereditary property $\mathcal H$ of graphs and some $p\in[0,1]$, the edit distance function $\operatorname{ed}_{\mathcal H}(p)$ is (asymptotically) the maximum proportion of "edits" (edge-additions plus edge-deletions) necessary to…
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied…
What is the minimum proportion of edges which must be added to or removed from a graph of density $p$ to eliminate all induced cycles of length $h$? The maximum of this quantity over all graphs of density $p$ is measured by the edit…
For a hereditary graph class $\mathcal{H}$, the $\mathcal{H}$-elimination distance of a graph $G$ is the minimum number of rounds needed to reduce $G$ to a member of $\mathcal{H}$ by removing one vertex from each connected component in each…
Computing efficiently a robust measure of similarity or dissimilarity between graphs is a major challenge in Pattern Recognition. The Graph Edit Distance (GED) is a flexible measure of dissimilarity between graphs which arises in…
A graph $G=(V,E)$ is distance hereditary if every induced path of $G$ is a shortest path. In this paper, we show that the eccentricity function $e(v)=\max\{d(v,u): u\in V\}$ in any distance-hereditary graph $G$ is almost unimodal, that is,…
Graph edit distance (GED) is a powerful and flexible graph matching paradigm that can be used to address different tasks in structural pattern recognition, machine learning, and data mining. In this paper, some new binary linear programming…
The normalized edit distance is one of the distances derived from the edit distance. It is useful in some applications because it takes into account the lengths of the two strings compared. The normalized edit distance is not defined in…
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another. It is NP-hard to compute in general, and a…