We present two constraints that partition the vertices of an undirected n-vertex, m-edge graph G=(V,E) into a set of vertex-disjoint trees. The first is the resource-forest constraint, where we assume that a subset R ⊆ V of the vertices are resource vertices. The constraint specifies that each tree in the forest must contain at least one resource vertex. This is the natural undirected counterpart of the tree constraint (Beldiceanu et al., 2005), which partitions a directed graph into a forest of directed trees where only certain vertices can be tree roots. We describe a hybrid-consistency algorithm that runs in 𝒪(m+n) time for the resource-forest constraint, a sharp improvement over the 𝒪(mn)bound that is known for the directed case. The second constraint is proper-forest. In this variant, we do not have the requirement that each tree contains a resource, but the forest must contain only proper trees, i.e., trees that have at least two vertices each. We develop a hybrid-consistency algorithm for this case whose running time is 𝒪(mn) in the worst case, and 𝒪(m√n) in many (typical) cases.
