The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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. An f-labeling scheme for a family of graphs labels the vertices of all graphs in such that for every graph G∈ and every two vertices u,v∈ G, the value f(u,v) can be inferred by merely inspecting the labels of u and v. This paper introduces a natural generalization: the notion of f-labeling schemes with queries, in whicharXiv:cs/0609163v1 fatcat:adtz2ulsufcrzddgmzrxjlim4q