Distance and routing 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 …
Strongly hyperbolic unit disk graphs
The class of Euclidean unit disk graphs is one of the most fundamental and well-studied
graph classes with underlying geometry. In this paper, we identify this class as a special …
graph classes with underlying geometry. In this paper, we identify this class as a special …
Isometric universal graphs
L Esperet, C Gavoille, C Groenland - SIAM Journal on Discrete Mathematics, 2021 - SIAM
A subgraph H of a graph G is isometric if the distances between vertices in H coincide with
the distances between the corresponding vertices in G. We show that for any integer n≥1 …
the distances between the corresponding vertices in G. We show that for any integer n≥1 …
Shorter labels for routing in trees
P Gawrychowski, W Janczewski, J Łopuszański - Proceedings of the 2021 …, 2021 - SIAM
A routing labeling scheme assigns a binary string, called a label, to each node in a network,
and chooses a distinct port number from {1,…, d} for every edge outgoing from a node of …
and chooses a distinct port number from {1,…, d} for every edge outgoing from a node of …