Frete Grátis
  • Google Plus

Path Problems In Networks (Cód: 7048193)

John Baras; George Theodorakopoulos; Jean Walrand

Morgan James Publishing POD

Ooopss! Este produto está temporariamente indisponível.
Mas não se preocupe, nós avisamos quando ele chegar.

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$ 177,70 em até 5x de R$ 35,54 sem juros
Cartão Saraiva R$ 168,82 (-5%) em até 1x no cartão ou em até 8x de R$ 22,21 sem juros

Crédito:
Boleto:
Cartão Saraiva:

Total: R$0,00

Em até 5x sem juros de R$ 0,00


Path Problems In Networks

R$177,70

Descrição

The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social networks. These applications show what kind of problems can be modeled as algebraic path problems; they also serve as examples on how to go about modeling new problems.

This monograph will be useful to network researchers, engineers, and graduate students. It can be used either as an introduction to the topic, or as a quick reference to the theoretical facts, algorithms, and application examples. The theoretical background assumed for the reader is that of a graduate or advanced undergraduate student in computer science or engineering. Some familiarity with algebra and algorithms is helpful, but not necessary. Algebra, in particular, is used as a convenient and concise language to describe problems that are essentially combinatorial.

Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications

Características

Produto sob encomenda Sim
Marca Morgan James Publishing POD
Cód. Barras 9781598299236
Altura 23.50 cm
I.S.B.N. 9781598299236
Profundidade 0.42 cm
Referência 9781598299236
Ano da edição 2010
Idioma Inglês
Número de Páginas 80
Peso 0.16 Kg
Largura 19.10 cm
AutorJohn Baras; George Theodorakopoulos; Jean Walrand

Avaliações

Avaliação geral: 0

Você está revisando: Path Problems In Networks