.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Tree-Based Graph Partitioning Constraint
Xavier Lorca
€ 180.93
FREE Delivery in Ireland
Description for Tree-Based Graph Partitioning Constraint
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. Num Pages: 250 pages, Illustrations. BIC Classification: PBT; UMN. Category: (G) General (US: Trade). Dimension: 162 x 237 x 27. Weight in Grams: 606.
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 ... Read more
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 ... Read more
Product Details
Publication date
2011
Publisher
ISTE Ltd and John Wiley & Sons Inc United Kingdom
Number of pages
250
Condition
New
Number of Pages
240
Format
Hardback
Place of Publication
London, United Kingdom
ISBN
9781848213036
SKU
V9781848213036
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Xavier Lorca
Xavier Lorca is Associate Professor of Computer Science at the école des Mines de Nantes in France.
Reviews for Tree-Based Graph Partitioning Constraint