02523nam 2200601 a 450 991083039710332120230124190829.01-118-60430-X1-299-14154-41-118-60447-41-118-60360-5(CKB)2670000000327427(EBL)1117284(OCoLC)827208456(SSID)ssj0000822636(PQKBManifestationID)11418080(PQKBTitleCode)TC0000822636(PQKBWorkID)10757090(PQKB)11201244(OCoLC)826652791(MiAaPQ)EBC1117284(EXLCZ)99267000000032742720110608d2011 uy 0engur|n|---|||||txtccrTree-based graph partitioning constraint[electronic resource] /Xavier LorcaLondon ISTE ;Hoboken, N.J. Wiley20111 online resource (252 p.)ISTEDescription based upon print version of record.1-84821-303-4 Includes bibliographical references and index.pt. 1. Constraint programming and foundations of graph theory -- pt. 2. Characterization of tree-based graph partitioning constraints -- pt. 3. Implementation : task planning -- pt. 4. Conclusion and future work.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 severISTEConstraint programming (Computer science)Graph theoryConstraint programming (Computer science)Graph theory.005.1/16005.116MAT029000bisacshLorca Xavier1680981MiAaPQMiAaPQMiAaPQBOOK9910830397103321Tree-based graph partitioning constraint4050073UNINA