Name: Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science) (en Inglés)
Price: 74810.00 CLP
Availability: InStock
Author: Erciyes, K.
ISBN: 9783030103385

portada Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science) (en Inglés)

Formato

Libro Físico

Autor

K. Erciyes

Editorial

Springer

Año

2019

Idioma

Inglés

N° páginas

471

Encuadernación

Tapa Blanda

Dimensiones

23.6 x 21.3 x 2.3 cm

Peso

0.77 kg.

ISBN13

9783030103385

N° edición

Categorías

Ciencia y análisis de datos
Algoritmos y estructuras de datos
Análisis y captura de datos
Teoría matemática de la computación
Machine learning: aprendizaje automático

Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science) (en Inglés)

K. Erciyes (Autor) · Springer · Tapa Blanda

Libro Físico

$ 74.810

$ 149.610

Ahorras: $ 74.800

50% descuento

Cantidad
Estado: Nuevo
Quedan 100 unidades

Envío normal

Origen: Reino Unido (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Miércoles 29 de Mayo y el Lunes 10 de Junio.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science) (en Inglés)"

This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms - including algorithms for big data - and an investigation into the conversion principles between the three algorithmic methods.Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website.This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.