Zobacz książki o podobnej tematyce

Więcej informacji o Guide to Graph Algorithms

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 201 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics Discrete mathematics

• Pełny tytuł: Guide to Graph Algorithms
• Podtytuł: Sequential, Parallel and Distributed
• Autor: Kayhan Erciyes
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 471
• EAN: 9783319732343
• ISBN: 331973234X
• ID: 18644561
• Wydawca: Springer International Publishing
• Waga: 988 g
• Wymiary: 241 × 160 × 30 mm
• Data wydania: 23. April 2018

Ulubione w innej kategorii

---

---

---