A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A Complexity Theory for Labeling Schemes
[article]
2018
arXiv
pre-print
Preserved Fulltext
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of its vertex labels. Due to the shortness constraint on the labels such schemes provide space-efficient representations for various graph classes, such as planar or interval graphs. We consider what graph classes cannot be represented by labeling schemes when
arXiv:1802.02819v1
fatcat:uy2s2d2m4rg6zfnhlt6noyg46y