Three- based Graph Partitioning constraint
Auteur: Xavier Lorca
Editeur : Wiley
En bibliothèque depuis le 19 décembre 2011
Cote : 040-11-01
Pas d'aperçu disponible
This important resource focuses on constraint satisfaction problems related to tree partitioning problems enriched by several additional constraints that restrict the possible partitions topology. 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.