Distance labeling schemes for well-separated graph classes Original Research Article

1. Introduction 2. The well-separation property 3. A labeling scheme for well-separated graphs 3.1. The labeling system 3.2. Computing the distances 3.3. Analysis 4. Distance labeling scheme for interval graphs 4.1. Definitions 4.2. Well-(2,logn)-separation of interval graphs 4.3. Correctness proof 5. Distance labeling scheme for permutation graphs 5.1. Definitions 5.2. Well-(6,logn)-separation of permutation graphs 5.3. Correctness proof References