Tree-based Graph Partitioning Constraint

Nonfiction, Science & Nature, Mathematics, Statistics
Cover of the book Tree-based Graph Partitioning Constraint by Xavier Lorca, Wiley
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Xavier Lorca ISBN: 9781118603604
Publisher: Wiley Publication: January 24, 2013
Imprint: Wiley-ISTE Language: English
Author: Xavier Lorca
ISBN: 9781118603604
Publisher: Wiley
Publication: January 24, 2013
Imprint: Wiley-ISTE
Language: English

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.
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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.
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.

More books from Wiley

Cover of the book Staying the Course as a CIO by Xavier Lorca
Cover of the book Visual Guide to Options, Enhanced Edition by Xavier Lorca
Cover of the book J.K. Lasser's Your Income Tax 2019 by Xavier Lorca
Cover of the book The Handbook of Communication and Corporate Social Responsibility by Xavier Lorca
Cover of the book The End of Cheap China by Xavier Lorca
Cover of the book How To Stress Less by Xavier Lorca
Cover of the book The Stress Effect by Xavier Lorca
Cover of the book Why Feminism? by Xavier Lorca
Cover of the book The Counseling Dictionary by Xavier Lorca
Cover of the book Genealogy For Dummies by Xavier Lorca
Cover of the book Louisiana by Xavier Lorca
Cover of the book An Introduction to Numerical Methods and Analysis by Xavier Lorca
Cover of the book Zielgenau bis ans Ende des Tunnels by Xavier Lorca
Cover of the book The Other "F" Word by Xavier Lorca
Cover of the book Industrial Scale Natural Products Extraction by Xavier Lorca
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy