Retourner à la page d'accueil
|Mis en vente dans la catégorie :
|
Suivre cet objet

Photo 1/1

Contrainte de partitionnement graphique à base d'arbre, couverture rigide par Lorca, X., Like New Us... - Photo 1/1
Vous en avez un à vendre ?
Vendez le vôtre

Contrainte de partitionnement graphique à base d'arbre, couverture rigide par Lorca, X., Like New Us...

État :
Comme neuf
2 disponibles
Prix :
173,66 USD
Environ159,81 EUR
Livraison :
Gratuit Economy Shipping. Afficher les détailspour la livraison
Lieu où se trouve l'objet : Jessup, Maryland, États-Unis
Délai de livraison :
Estimé entre le sam. 22 juin et le mer. 3 juil. à 43230
Les dates de livraison estimées - la page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet prennent en compte le délai d'expédition indiqué par le vendeur, le code postal de l'expéditeur, le code postal du destinataire et la date d'acceptation de l'offre. Elles dépendent du service de livraison sélectionné et de la date de réception du paiementréception du paiement - la page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet. Les délais de livraison peuvent varier, notamment pendant les périodes de pointe.
Retours :
Retour sous 14 jours. L'acheteur paie les frais de retour. Afficher les détails- pour en savoir plus sur les retours
Paiements :
     

Achetez en toute confiance

Garantie client eBay
Obtenez un remboursement si vous ne recevez pas l'objet que vous avez commandé. 
En savoir plusGarantie client eBay - la page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet

Détails sur le vendeur

Inscrit comme vendeur professionnel
Signaler cet objet - La page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :363603064142
Dernière mise à jour le 26 févr. 2024 05:12:03 CET. Afficher toutes les modificationsAfficher toutes les modifications

Caractéristiques de l'objet

État
Comme neuf: Livre qui semble neuf, mais ayant déjà été lu. La couverture ne présente aucune marque ...
Book Title
Tree-based Graph Partitioning Constraint
ISBN
9781848213036
Subject Area
Computers, Mathematics
Publication Name
Tree-Based Graph Partitioning Constraint
Item Length
9.5 in
Publisher
Wiley & Sons, Incorporated, John
Subject
Programming / General, Probability & Statistics / General, Graphic Methods
Publication Year
2011
Type
Textbook
Format
Hardcover
Language
English
Item Height
1.1 in
Author
Xavier Lorca
Item Width
6.5 in
Item Weight
21.2 Oz
Number of Pages
240 Pages

À propos de ce produit

Product Information

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.

Product Identifiers

Publisher
Wiley & Sons, Incorporated, John
ISBN-10
1848213034
ISBN-13
9781848213036
eBay Product ID (ePID)
103001950

Product Key Features

Author
Xavier Lorca
Publication Name
Tree-Based Graph Partitioning Constraint
Format
Hardcover
Language
English
Subject
Programming / General, Probability & Statistics / General, Graphic Methods
Publication Year
2011
Type
Textbook
Subject Area
Computers, Mathematics
Number of Pages
240 Pages

Dimensions

Item Length
9.5 in
Item Height
1.1 in
Item Width
6.5 in
Item Weight
21.2 Oz

Additional Product Features

LCCN
2011-018477
Intended Audience
Scholarly & Professional
Lc Classification Number
Qa76.612.L67 2011
Table of Content
PART 1. CONSTRAINT PROGRAMMING AND FOUNDATIONS OF GRAPH THEORY 1 Introduction to Part 1 3 Chapter 1. Introduction to Constraint Programming 5 1.1. What is a variable? 7 1.2. What is a constraint? 8 1.3. What is a global constraint? 10 1.4. What is a propagation algorithm? 11 1.5. What is a consistency level? 14 1.6. What is a constraint solver? 15 1.7. Constraint solvers at work 17 1.8. Organization structure 21 Chapter 2. Graph Theory and Constraint Programming 23 2.1. Modeling graphs with constraint programming 24 2.2. Graph theory at work in constraint programming 34 2.3. Constraint programming at work in graph theory 37 Chapter 3. Tree Graph Partitioning 39 3.1. In undirected graphs 39 3.2. In directed graphs 42 PART 2. CHARACTERIZATION OF TREE-BASED GRAPH PARTITIONING CONSTRAINTS 47 Chapter 4. Tree Constraints in Undirected Graphs 49 4.1. Decomposition 49 4.2. Definition of constraints 51 4.3. A filtering algorithm for the proper-forest constraint 56 4.4. Filtering algorithm for the resource-forest constraint 70 4.5. Summary of undirected tree constraints 80 Chapter 5. Tree Constraints in Directed Graphs 83 5.1. Decomposition 83 5.2. Definition of constraints 86 5.3. Filtering algorithm for the tree constraint 89 5.4. Filtering algorithm for the proper-tree constraint 96 5.5. Summary of tree constraints in directed and undirected graphs 113 Chapter 6. Additional Constraints Linked to Graph Partitioning 117 6.1. Definition of restrictions 118 6.2. Complexity zoo 123 6.3. Interaction between the number of trees and the number of proper trees 129 6.4. Relation of precedence between the vertices of the graph 130 6.5. Relation of conditional precedence 137 6.6. Relation of incomparability between graph vertices 140 6.7. Interactions between precedence and incomparability constraints 143 6.8. Constraining the interior half-degree of each vertex 148 6.9. Summary 151 Chapter 7. The Case of Disjoint Paths 153 7.1. Minimum number of paths in acyclic directed graphs 156 7.2. Minimum number of paths in any directed graph 161 7.3. A path partitioning constraint 169 7.4. Summary 173 Chapter 8. Implementation of a Tree Constraint 175 8.1. Original implementation 176 8.2. Toward a "portable" implementation 181 8.3. Conclusion 191 PART 3. IMPLEMENTATION: TASK PLANNING 193 Introduction to Part 3 195 Chapter 9. First Model in Constraint Programming 199 9.1. Model for the coherence of displacements in space 199 9.2. Modeling resource consumption 200 9.3. Modeling time windows 201 9.4. Modeling coordination constraints between units 202 9.5. Limitations of the proposed model 203 Chapter 10. Advanced Model in Constraint Programming 205 10.1. Modeling the coherence of displacements in space 206 10.2. Modeling resource consumption 208 10.3. Integration of temporal aspects 208 10.4. Propagating time windows 213 PART 4. CONCLUSION AND FUTURE WORK 225 Chapter 11. Conclusion 227 Chapter 12. Perspectives and Criticisms 231 Bibliography 233 Index 239
Copyright Date
2011
Illustrated
Yes

Description de l'objet fournie par le vendeur

Informations sur le vendeur professionnel

Expert Trading Limited
John Boyer
9220 Rumsey Rd
Ste 101
21045-1956 Columbia, MD
United States
Afficher les coordonnées
: liam-e esserdAmoc.secirpkoobtaerg@sredroyabe
Je certifie que toutes mes activités de vente seront conformes à toutes les lois et réglementations de l'UE.
Great Book Prices Store

Great Book Prices Store

96,8% d'évaluations positives
1,2 millions objets vendus
Visiter la BoutiqueContacter
Répond en général sous 24 heures

Évaluations détaillées du vendeur

Moyenne pour les 12 derniers mois

Description exacte
4.9
Frais de livraison raisonnables
5.0
Livraison rapide
4.9
Communication
4.8
Inscrit comme vendeur professionnel

Évaluations en tant que vendeur (343.044)

c***5 (1589)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Great experience in buying from this vendor. Great communication, and great care in packaging. Would not hesitate to do business with again. Thank you.
Spring Creek, Hardcover by Lyons, Nick; Lyons, Mari (ILT), Brand New, Free sh... (n°386978702910)
s***s (78)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
great seller
Newly Born Woman, Paperback by Cixous, Helene; Clement, Catherine, Used Good ... (n°364499646136)
e***z (83)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Great communication to get my refund request in promptly, thank you!
David Lynch : Beautiful Dark, Paperback by Olson, Greg, Like New Used, Free s... (n°385875710159)
Afficher toutes les évaluations