Shorter Labeling Schemes for Planar Graphs

Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk

An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for…