Revisiting the tree Constraint

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.

[1]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[2]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[3]  Meinolf Sellmann,et al.  Cost-Based Filtering for Shorter Path Constraints , 2003, CP.

[4]  Christine Solnon,et al.  A Global Constraint for Graph Isomorphism Problems , 2004, CPAIOR.

[5]  Giuseppe F. Italiano,et al.  Finding strong bridges and strong articulation points in linear time , 2010, Theor. Comput. Sci..

[6]  Mats Carlsson,et al.  Global Constraint Catalogue: Past, Present and Future , 2007, Constraints.

[7]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[8]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[9]  Yves Deville,et al.  Filtering for Subgraph Isomorphism , 2007, CP.

[10]  Yves Deville,et al.  Using Dominators for Solving Constrained Path Problems , 2006, PADL.

[11]  Mikkel Thorup,et al.  Dominators in Linear Time , 1999, SIAM J. Comput..

[12]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[13]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[14]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[15]  Christian Bessière.  Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

[16]  Xavier Lorca,et al.  The tree Constraint , 2005, CPAIOR.

[17]  Luis Quesada,et al.  Solving constrained graph problems using reachability constraints based on transitive closure and dominators / Résolution de problèmes de graphes contraints à l'aide de contraintes d'atteignabilité basées sur la clôture transitive et les dominateurs , 2007 .

[18]  Sophie Demassey,et al.  Sequencing and Counting with the multicost-regular Constraint , 2009, CPAIOR.

[19]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[20]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[21]  Haim Kaplan,et al.  A new, simpler linear-time dominators algorithm , 1998, TOPL.

[22]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[23]  Jean-Charles Régin,et al.  Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint , 2008, CPAIOR.