Optimal labelling schemes for adjacency, comparability and reachability

12/03/2020
by   Marthe Bonamy, et al.
0

We construct asymptotically optimal adjacency labelling schemes for every hereditary class containing 2^Ω(n^2) n-vertex graphs as n→∞. 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. We also use this result to construct a poset on 2^n/4+o(n) elements, that contains all n-element posets. All these results are best possible, up to the lower order term, and solve several open problems in the area.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2020

Adjacency Labelling for Planar Graphs (and Beyond)

We show that there exists an adjacency labelling scheme for planar graph...
research
02/08/2018

A Complexity Theory for Labeling Schemes

In a labeling scheme the vertices of a given graph from a particular cla...
research
07/02/2020

Graphs without gap-vertex-labellings: families and bounds

A proper labelling of a graph G is a pair (π,c_π) in which π is an assig...
research
02/08/2021

Local certification of graphs on surfaces

A proof labelling scheme for a graph class 𝒞 is an assignment of certifi...
research
09/07/2023

Adjacency Sketches in Adversarial Environments

An adjacency sketching or implicit labeling scheme for a family F of gra...
research
05/30/2018

Adjacency and Tensor Representation in General Hypergraphs.Part 2: Multisets, Hb-graphs and Related e-adjacency Tensors

HyperBagGraphs (hb-graphs as short) extend hypergraphs by allowing the h...

Please sign up or login with your details

Forgot password? Click here to reset