1+ε approximation of tree edit distance in quadratic time
Edit distance is one of the most fundamental problems in computer science. Tree edit
distance is a natural generalization of edit distance to ordered rooted trees. Such a …
distance is a natural generalization of edit distance to ordered rooted trees. Such a …
Hardness of exact distance queries in sparse graphs through hub labeling
A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected,
unweighted graph such that the distance between any pair of vertices can be decoded …
unweighted graph such that the distance between any pair of vertices can be decoded …
Distance labeling schemes for cube-free median graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in
such a way that the distance between any two vertices u and v can be determined efficiently …
such a way that the distance between any two vertices u and v can be determined efficiently …
Densité, VC-dimension et étiquetages de graphes
S Ratel - 2019 - hal.science
Un schéma d'étiquetage est un procédé permettant de distribuer la représentation d'un
graphe sur ses sommets. Il consiste en une fonction d'encodage qui attribue des étiquettes …
graphe sur ses sommets. Il consiste en une fonction d'encodage qui attribue des étiquettes …
[PDF][PDF] ÉCOLE DOCTORALE 184
S RATEL - 2019 - sratel.perso.centrale-marseille.fr
A labeling scheme is a way of distributing the representation of a graph over its vertices.
Such a scheme consists in an encoding function that constructs a (short) binary label for …
Such a scheme consists in an encoding function that constructs a (short) binary label for …