Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the complexity of the identifiable subgraph problem, revisited   A bipartite graph $G=(L,R;E)$ with at least one edge is said to be
identifiable if for every vertex $v\in L$, the subgraph induced by its
non-neighbors has a matching of cardinality $|L|-1$. An $\ell$-subgraph of $G$
is an induced subgraph of $G$ obtained by deleting from it some vertices in $L$
together with all their neighbors. The Identifiable Subgraph problem is the
problem of determining whether a given bipartite graph contains an identifiable
$\ell$-subgraph.
  We show that the Identifiable Subgraph problem is polynomially solvable,
along with the version of the problem in which the task is to delete as few
vertices from $L$ as possible together with all their neighbors so that the
resulting $\ell$-subgraph is identifiable. We also complement a known
APX-hardness result for the complementary problem in which the task is to
minimize the number of remaining vertices in $L$, by showing that two
parameterized variants of the problem are W[1]-hard.

9
The categories of this paper are: nlin
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat