29 citations · 126 across the 20 of their papers we have counts for
4 papers · 1 filter
Distance labeling schemes for trees
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen +1
We consider distance labeling schemes for trees: given a tree with nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, b…
Sublinear Distance Labeling
Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen +1
A distance labeling scheme labels the nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the…
Simpler, faster and shorter labels for distances in graphs
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen +1
We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to deter…
Optimal induced universal graphs and adjacency labeling for trees
Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen
We show that there exists a graph with nodes, where any forest of nodes is a node-induced subgraph of . Furthermore, for constant arboricity , the result impli…