Code: 49425761
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, approximation algorithms and heuristics f ... more
English
75.66 €
RRP: 83.78 €
You save 8.12 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 183 loyalty points
Book 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, approximation algorithms and heuristics for such problems and implementation of advanced graph structures in machine learning. 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:
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 and machine learning.
Dr. K. Erciyes is professor of computer engineering at Yasar University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, and Guide to Distributed Algorithms.
Book details
Book category Books in German Naturwissenschaften, Medizin, Informatik, Technik Informatik, EDV Informatik
75.66 €
English
Collection points Bratislava a 12880 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25764 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )