Revisiting the tree Constraint

Authors:
Jean-Guillaume Fages;Xavier Lorca
Affiliations:
école des Mines de Nantes, INRIA, LINA UMR CNRS 6241, Nantes Cedex, France;école des Mines de Nantes, INRIA, LINA UMR CNRS 6241, Nantes Cedex, France
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 12
Cited 2

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A new, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dominators in Linear Time

SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Constraint Catalogue: Past, Present and Future

Constraints
Sequencing and Counting with the multicost-regular Constraint

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Filtering for subgraph isomorphism

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Finding strong bridges and strong articulation points in linear time

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Using dominators for solving constrained path problems

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
The tree constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Improved filtering for weighted circuit constraints

Constraints
Explaining circuit propagation

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.