Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Complexity Theory for Labeling Schemes   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 the algorithm which determines adjacency
is subjected to computational constraints.

21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
18
The categories of this paper are: econ
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
10
The categories of this paper are: q-bio