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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Fages, J. G., & Lorca, X. (2011). Revisiting the tree constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6876 LNCS, pp. 271–285). https://doi.org/10.1007/978-3-642-23786-7_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
