Distance Labeling for Families of Cycles

Arseny M. Shur, Mikhail Rubinchik

For an arbitrary finite family of graphs, the distance labeling problem asks to assign labels to all nodes of every graph in the family in a way that allows one to recover the dist…