Stephen Alstrup

most citedAdjacency labeling schemes and induced-universal graphs

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2016★ 1 cited

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm +2

A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$ . For the family of all undirected graphs on $n$ verti…

cs.DS2014★ 1 cited

Adjacency labeling schemes and induced-universal graphs

Stephen Alstrup, Haim Kaplan, Mikkel Thorup +1

We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n /2 + O (1)$ bits, such that given the labels of two vertices, a…