Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finding small-width connected path decompositions in polynomial time   A connected path decomposition of a simple graph $G$ is a path decomposition
$(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup
X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$
is then the minimum width over all connected path decompositions of $G$. We
prove that for each fixed $k$, the connected pathwidth of any input graph can
be computed in polynomial-time. This answers an open question raised by Fedor
V. Fomin during the GRASTA 2017 workshop, since connected pathwidth is
equivalent to the connected (monotone) node search game.

16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
18
The categories of this paper are: econ
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys