Guide to Graph Algorithms, Softcover reprint of the original 1st ed. 2018 Sequential, Parallel and Distributed Texts in Computer Science Series
Auteur : Erciyes K
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.
Introduction
Part I: Fundamentals
Introduction to Graphs
Graph Algorithms
Parallel Graph Algorithms
Distributed Graph Algorithms
Part II: Basic Graph Algorithms
Trees and Graph Traversals
Weighted Graphs
Connectivity
Matching
Independence, Domination and Vertex Cover
Coloring
Part III: Advanced Topics
Algebraic and Dynamic Graph Algorithms
Analysis of Large Graphs
Complex Networks
Epilogue
Appendix A: Pseudocode Conventions
Appendix B: Linear Algebra Review
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 algorithms
Describes techniques for conversion between the different methods
Date de parution : 02-2019
Ouvrage de 471 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierDate de parution : 04-2018
Ouvrage de 471 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 79,11 €
Ajouter au panier