Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Local Computation Algorithms for Graphs of Non-Constant Degrees   In the model of \emph{local computation algorithms} (LCAs), we aim to compute
the queried part of the output by examining only a small (sublinear) portion of
the input. Many recently developed LCAs on graph problems achieve time and
space complexities with very low dependence on $n$, the number of vertices.
Nonetheless, these complexities are generally at least exponential in $d$, the
upper bound on the degree of the input graph. Instead, we consider the case
where parameter $d$ can be moderately dependent on $n$, and aim for
complexities with subexponential dependence on $d$, while maintaining
polylogarithmic dependence on $n$. We present: a randomized LCA for computing
maximal independent sets whose time and space complexities are quasi-polynomial
in $d$ and polylogarithmic in $n$; for constant $\epsilon > 0$, a randomized
LCA that provides a $(1-\epsilon)$-approximation to maximum matching whose time
and space complexities are polynomial in $d$ and polylogarithmic in $n$.

34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
3
The categories of this paper are: physics
10
The categories of this paper are: q-bio
12
The categories of this paper are: nucl-th