Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain
  variables   Graph domain variables and constraints are an extension of constraint
programming introduced by Dooms et al. This approach had been further
investigated by Fages in its PhD thesis. On the other hand, Beldiceanu et al.
presented a generic filtering scheme for global constraints based on graph
properties. This scheme strongly relies on the computation of graph properties'
bounds and can be used in the context of graph domain variables and constraints
with a few adjustments. Bounds of MIN_NCC and MAX_NCC had been defined for the
graph-based representation of global constraint for the path_with_loops graph
class. In this note, we generalize those bounds for graph domain variables and
for any graph class. We also provide a filtering scheme for any graph class and
arbitrary bounds.

31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys