This book focuses on constraint satisfaction problems related to tree partitioning problems enriched by several additional constraints that restrict the possible partitions topology. On the one hand, this title focuses on the structural properties of tree partitioning constraints. On the other hand, it is dedicated to the interactions between the tree partitioning problem and classical restrictions (such as precedence relations or incomparability relations between nodes) involved in practical applications.
Precisely, Tree-based Graph Partitioning Constraint shows how to globally take into account several restrictions within one single tree partitioning constraint. Another interesting aspect of this book is related to the implementation of such a constraint. In the context of graph-based global constraints, the book illustrates how a fully dynamic management of data structures makes the runtime of filtering algorithms independent of the graph density.
Keywords: Computational & Graphical Statistics, Tree partitioning pattern, the Hamiltonian path problem, or K-node disjoint path problems, , tree graph partitioning problem, , tree partitioning constraint satisfaction problems, tree partitioning topology, restrictions within one single tree partitioning constraint, , implementation of tree partitioning pattern constraint, tree partitioning dynamic management ,