Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Red Domination in Perfect Elimination Bipartite Graphs   The $k$ red domination problem for a bipartite graph $G=(X,Y,E)$ is to find a
subset $D \subseteq X$ of cardinality at most $k$ that dominates vertices of
$Y$. The decision version of this problem is NP-complete for general bipartite
graphs but solvable in polynomial time for chordal bipartite graphs. We
strengthen that result by showing that it is NP-complete for perfect
elimination bipartite graphs. We present a tight upper bound on the number of
such sets in bipartite graphs, and show that we can calculate that number in
linear time for convex bipartite graphs. We present a linear space linear delay
enumeration algorithm that needs only linear preprocessing time.

11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an