Efficient algorithms for acyclic colorings of graphs
Theoretical Computer Science
Efficient Algorithms for Vertex Arboricity of Planar Graphs
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Necessary Condition for Path Partitioning Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
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
Revisiting the tree Constraint
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
Computing strong articulation points and strong bridges in large scale graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Explaining circuit propagation
Constraints
| Hi-index | 0.00 |
This article presents an arc-consistency algorithm for the tree constraint, which enforces the partitioning of a digraph $\mathcal{G}$ = ($\mathcal{V},\mathcal{E}$) into a set of vertex-disjoint anti-arborescences. It provides a necessary and sufficient condition for checking the tree constraint in $\mathcal{O}(|\mathcal{V}| + |\mathcal{E}|)$ time, as well as a complete filtering algorithm taking $\mathcal{O}(|\mathcal{V}| \cdot |\mathcal{E}|)$ time.