Articles liés à Guide to Graph Algorithms: Sequential, Parallel and...

Guide to Graph Algorithms: Sequential, Parallel and Distributed - Couverture rigide

 
9783319732343: Guide to Graph Algorithms: Sequential, Parallel and Distributed

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l?auteur

Dr. K. Erciyes is an Emeritus Professor of Computer Engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks and Distributed and Sequential Algorithms for Bioinformatics.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Acheter neuf

Afficher cet article
EUR 69,21

Autre devise

EUR 7,70 expédition depuis Etats-Unis vers France

Destinations, frais et délais

Autres éditions populaires du même titre

9783030103385: Guide to Graph Algorithms: Sequential, Parallel and Distributed

Edition présentée

ISBN 10 :  3030103382 ISBN 13 :  9783030103385
Editeur : Springer, 2019
Couverture souple

Résultats de recherche pour Guide to Graph Algorithms: Sequential, Parallel and...

Image d'archives

Erciyes, K
Edité par Springer, 2018
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : Books Puddle, New York, NY, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 26376267920

Contacter le vendeur

Acheter neuf

EUR 69,21
Autre devise
Frais de port : EUR 7,70
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

K Erciyes
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents detailed coverage of sequential graph algorithms, together with some sample parallel and distributed graph algorithm design methods Provides a comparative analysis of the three methods of sequential, parallel and distributed graph algori. N° de réf. du vendeur 196762102

Contacter le vendeur

Acheter neuf

EUR 68,62
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Erciyes, K
Edité par Springer, 2018
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : Majestic Books, Hounslow, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 370858831

Contacter le vendeur

Acheter neuf

EUR 68,96
Autre devise
Frais de port : EUR 10,37
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Erciyes, K
Edité par Springer, 2018
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 18376267930

Contacter le vendeur

Acheter neuf

EUR 74,91
Autre devise
Frais de port : EUR 7,95
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

K. Erciyes
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783319732343

Contacter le vendeur

Acheter neuf

EUR 80,24
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

K. Erciyes
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 492 pp. Englisch. N° de réf. du vendeur 9783319732343

Contacter le vendeur

Acheter neuf

EUR 80,24
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

K. Erciyes
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Buch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 492 pp. Englisch. N° de réf. du vendeur 9783319732343

Contacter le vendeur

Acheter neuf

EUR 80,24
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Erciyes, K
Edité par Springer, 2018
ISBN 10 : 331973234X ISBN 13 : 9783319732343
Neuf Couverture rigide

Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Hardcover. Etat : New. New. book. N° de réf. du vendeur ERICA773331973234X6

Contacter le vendeur

Acheter neuf

EUR 136,38
Autre devise
Frais de port : EUR 29,29
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier