A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Informative labeling schemes for graphs

2005
*
Theoretical Computer Science
*

This paper introduces the notion of informative labeling schemes for arbitrary graphs. Let f (W ) be a function on subsets of vertices W . An f labeling scheme labels the vertices of a weighted graph G in such a way that f (W ) can be inferred (or at least approximated) efficiently for any vertex subset W of G by merely inspecting the labels of the vertices of W, without having to use any additional information sources. A number of results illustrating this notion are presented in the paper. We

doi:10.1016/j.tcs.2005.03.015
fatcat:aigpwzyhorh3rpueyf4ita7iwu