Optimal labelling schemes for adjacency, comparability, and reachability - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Optimal labelling schemes for adjacency, comparability, and reachability

Louis Esperet
Carla Groenland
  • Fonction : Auteur
Alex Scott
  • Fonction : Auteur

Résumé

We construct asymptotically optimal adjacency labelling schemes for every hereditary class containing $2^{\Omega(n^2)}$ $n$-vertex graphs as $n\to \infty$. This regime contains many classes of interest, for instance perfect graphs or comparability graphs, for which we obtain an efficient adjacency labelling scheme with labels of $n/4+o(n)$ bits per vertex. This implies the existence of a reachability labelling scheme for digraphs with labels of $n/4+o(n)$ bits per vertex. All these results are best possible, up to the lower order term, and solve several open problems in the area.

Dates et versions

hal-03039884 , version 1 (04-12-2020)

Identifiants

Citer

Marthe Bonamy, Louis Esperet, Carla Groenland, Alex Scott. Optimal labelling schemes for adjacency, comparability, and reachability. 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021), 2021, Rome, Italy. pp.1109-1117, ⟨10.1145/3406325.3451102⟩. ⟨hal-03039884⟩
24 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More