4 citations · 5 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 4 cited
Optimal Adjacency Labels for Subgraphs of Cartesian Products
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
For any hereditary graph class , we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in . As a…
cs.DS2022
Sketching Distances in Monotone Graph Classes
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
We study the two-player communication problem of determining whether two vertices are nearby in a graph , with the goal of determining the graph structures that allow the…