Revisiting the tree Constraint

Xavier Lorca 1, 2 Jean-Guillaume Fages 2
2 TASC - Theory, Algorithms and Systems for Constraints
Inria Rennes – Bretagne Atlantique , Département informatique - EMN, LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Xavier Lorca <>
Submitted on : Friday, November 25, 2011 - 10:41:35 AM
Last modification on : Friday, June 22, 2018 - 9:31:36 AM
Long-term archiving on : Friday, November 16, 2012 - 12:00:54 PM


Files produced by the author(s)



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⟩



Record views


Files downloads