Can I read Tree-based Graph Partitioning Constraint on EtoBox?

Tree-based Graph Partitioning Constraint by Xavier Lorca is a book available to read on EtoBox.

What is Tree-based Graph Partitioning Constraint about?

<p>Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Nevertheless, these problems are not based on the same partitioning pattern: generally, patterns like cycles, paths, or trees are distinguished. Moreover, the practical applications are often not limited to theoretical problems like the Hamiltonian path problem, or K-node disjoint path problems. Indeed, they usually combine the graph partitioning problem with several restrictions related to the topology of nodes and arcs. The diversity of implied constraints in real-life applications is a practical limit to the resolution of such problems by approaches considering the partitioning problem independently from each additional restriction.<br> 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

Author

Xavier Lorca

Publisher

Wiley-ISTE

Published

2011

Language

EN

ISBN

9781118604472

Subjects

Science, Mathematics, Computer Science