Artboard 33 Artboard 16 Artboard 18 Artboard 15 Artboard 21 Artboard 1 Artboard 2 Artboard 5 Artboard 45 Artboard 45 Artboard 22 Artboard 9 Artboard 23 Artboard 17? Artboard 28 Artboard 43 Artboard 49 Artboard 47 Artboard 38 Artboard 32 Artboard 8 Artboard 22 Artboard 5 Artboard 25 Artboard 1 Artboard 42 Artboard 11 Artboard 41 Artboard 13 Artboard 23 Artboard 10 Artboard 4 Artboard 9 Artboard 20 Artboard 6 Artboard 11 Artboard 7 Artboard 3 Artboard 3 Artboard 12 Artboard 25 Artboard 34 Artboard 39 Artboard 24 Artboard 13 Artboard 19 Artboard 7 Artboard 24 Artboard 31 Artboard 4 Artboard 14 Artboard 27 Artboard 30 Artboard 36 Artboard 44 Artboard 12 Artboard 17 Artboard 17 Artboard 6 Artboard 27 Artboard 19 Artboard 30 Artboard 29 Artboard 29 Artboard 26 Artboard 18 Artboard 2 Artboard 20 Artboard 35 Artboard 15 Artboard 14 Artboard 48 Artboard 50 Artboard 26 Artboard 16 Artboard 40 Artboard 21 Artboard 29 Artboard 10 Artboard 37 Artboard 3 Artboard 3 Artboard 46 Artboard 8
selo-progressivo-livros
e-book

Tree-based Graph Partitioning Constraint (Cód: 9312559)

Xavier Lorca

Wiley (Digital)

Ooops! Este produto não está mais a venda.
Mas não se preocupe, temos uma versão atualizada para você.

Ooopss! Este produto está fora de linha, mas temos outras opções para você.
Veja nossas sugestões abaixo!

R$ 140,79

em até 4x de R$ 35,20 sem juros

Total:

Em até 1x sem juros de


Crédito:
Boleto:
Cartão Saraiva:

Total:

Em até 4x sem juros de


Tree-based Graph Partitioning Constraint

R$140,79

Descrição

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.

Características

Peso 0.00 Kg
Produto sob encomenda Sim
Marca Wiley (Digital)
Número de Páginas 240 (aproximado)
Idioma 337
Acabamento e-book
Territorialidade Internacional
Formato Livro Digital Epub
Gratuito Não
Proteção Drm Sim
Início da Venda 10/01/2016
Código do Formato Epub
Cód. Barras 9781118603604
Número da edição 1
Ano da Publicação 113
AutorXavier Lorca