| Abstract | : | Labeling schemes are schemes for labeling the nodes of a graph in a way that will allow one to efficiently extract information concerning various properties of the nodes locally and directly from their labels. Of particular interest are compact label-based representations (i.e., ones using short labels). The talk will survey some known results concerning labeling schemes for graphs, including upper and lower bounds for several interesting functions and graph families, and will also discuss directions for future research. |
