Table of contents
About this book
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.
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.
- DOI https://doi.org/10.1007/978-3-319-73235-0
- Copyright Information Springer International Publishing AG, part of Springer Nature 2018
- Publisher Name Springer, Cham
- eBook Packages Computer Science
- Print ISBN 978-3-319-73234-3
- Online ISBN 978-3-319-73235-0
- Series Print ISSN 1868-0941
- Series Online ISSN 1868-095X
- Buy this book on publisher's site