Labeling Schemes with Queries

Amos Korman, Shay Kutten

We study the question of ``how robust are the known lower bounds of labeling schemes when one increases the number of consulted labels''. Let $f$ be a function on pairs of vertices…