Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Faster parameterized algorithm for pumpkin vertex deletion set   A directed graph $G$ is called a pumpkin if $G$ is a union of induced paths
with a common start vertex $s$ and a common end vertex $t$, and the internal
vertices of every two paths are disjoint. We give an algorithm that given a
directed graph $G$ and an integer $k$, decides whether a pumpkin can be
obtained from $G$ by deleting at most $k$ vertices. The algorithm runs in
$O^*(2^k)$ time.

14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin