TY - JOUR

T1 - Distance labeling schemes for well-separated graph classes

AU - Katz, Michal

AU - Katz, Nir A.

AU - Peleg, David

PY - 2005/1/30

Y1 - 2005/1/30

N2 - Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown in this paper that the classes of interval graphs and permutation graphs enjoy such a distance labeling scheme using O(log2 n) bit labels on n-vertex graphs. Towards establishing these results, we present a general property for graphs, called well-(α, g)-separation, and show that graph classes satisfying this property have O(g(n) log n) bit labeling schemes. In particular, interval graphs are well-(2, log n)-separated and permutation graphs are well-(6, log n)-separated.

AB - Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown in this paper that the classes of interval graphs and permutation graphs enjoy such a distance labeling scheme using O(log2 n) bit labels on n-vertex graphs. Towards establishing these results, we present a general property for graphs, called well-(α, g)-separation, and show that graph classes satisfying this property have O(g(n) log n) bit labeling schemes. In particular, interval graphs are well-(2, log n)-separated and permutation graphs are well-(6, log n)-separated.

KW - Distance in graphs

KW - Interval graphs

KW - Labeling schemes

KW - Permutation graphs

UR - http://www.scopus.com/inward/record.url?scp=9344271551&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2004.03.005

DO - 10.1016/j.dam.2004.03.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:9344271551

SN - 0166-218X

VL - 145

SP - 384

EP - 402

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 3

ER -