Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Classification of Connected f -factor Problems inside NP   Given an undirected graph G = (V, E) with n vertices, and a function f : V ->
N, we consider the problem of finding a connected f -factor in G. In this work
we design an algorithm to check for the existence of a connected f -factor, for
the case where f (v) >= n/g(n), for all v in V and g(n) is polylogarithmic in
n. The running time of our algorithm is O(n^{2g(n)}. As a consequence of this
algorithm we conclude that the complexity of connected f -factor for the case
we consider is unlikely to be NP-Complete unless the Exponential Time
Hypothesis (ETH) is false. Secondly, under the assumption of the ETH, we show
that it is also unlikely to be in P for g(n) in O((log n)^{1+eps} ) for any
eps> 0. Therefore, our results show that for all eps> 0, connected f -factor
for f (v) >= n/O(log n)^{1+eps}) is in NP-Intermediate unless the ETH is false.
Further, for any constant c > 0, when g(n) = c, our algorithm for connected f
-factor runs in polynomial time. Finally, we extend our algorithm to compute a
minimum weight connected f -factor in edge weighted graphs in the same
asymptotic time bounds.

11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an