Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Satisfactory Partition Problem   The Satisfactory Partition problem consists in deciding if the set of
vertices of a given undirected graph can be partitioned into two nonempty parts
such that each vertex has at least as many neighbours in its part as in the
other part. This problem was introduced by Gerber and Kobler [European J. Oper.
Res. 125 (2000) 283-291] and further studied by other authors, but its
parameterized complexity remains open until now. It is known that the
Satisfactory Partition problem, as well as a variant where the parts are
required to be of the same cardinality, are NP-complete. We enhance our
understanding of the problem from the viewpoint of parameterized complexity by
showing that (1) the problem is FPT when parameterized by the neighbourhood
diversity of the input graph, (2) it can be solved in $O(n^{8 {\tt cw}})$ where
${\tt cw}$ is the clique-width,(3) a generalized version of the problem is
W[1]-hard when parameterized by the treewidth.

34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
3
The categories of this paper are: physics