Revisiting the tree Constraint

Xavier Lorca (1, 2) , Jean-Guillaume Fages (2)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 TASC - Theory, Algorithms and Systems for Constraints

This paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. This result allows to tackle larger scale problems involving graph partitioning.

Domaines: Recherche opérationnelle [math.OC]; Intelligence artificielle [cs.AI]

Xavier Lorca, Jean-Guillaume Fages. Revisiting the tree Constraint. Principles and Practice of Constraint Programming, 2011, Perugia, Italy. pp.271-285, ⟨10.1007/978-3-642-23786-7_22⟩. ⟨hal-00644787⟩