Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Properties of nowhere dense graph classes related to independent set
  problem   A set is called r-independent, if every two vertices of it are in distance
greater then r. In the r-independent set problem with parameter k, we ask
whether in a given graph G there exists an r-independent set of size k. In this
work we present an algorithm for this problem, which applied to a graph from
any fixed nowhere dense class, works in time bounded by f(k, r)*G, for some
function f. We also present alternative algorithm, with running time bounded by
g(k, r)*G, working on slightly more general classes of graphs.

32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
6
The categories of this paper are: astro-ph