Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Parameterized Aspects of Triangle Enumeration   The task of listing all triangles in an undirected graph is a fundamental
graph primitive with numerous applications. It is trivially solvable in time
cubic in the number of vertices. It has seen a significant body of work
contributing to both theoretical aspects (e.g., lower and upper bounds on
running time, adaption to new computational models) as well as practical
aspects (e.g. algorithms tuned for large graphs). Motivated by the fact that
the worst-case running time is cubic, we perform a systematic parameterized
complexity study of triangle enumeration. We provide both positive results (new
enumerative kernelizations, "subcubic" parameterized solving algorithms) as
well as negative results (presumable uselessness in terms of "faster"
parameterized algorithms of certain parameters such as graph diameter). To this
end, we introduce new and extend previous concepts.

7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat