Authors:
- 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
Part of the book series: Texts in Computer Science (TCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (15 chapters)
-
Front Matter
-
Fundamentals
-
Front Matter
-
-
Basic Graph Algorithms
-
Front Matter
-
-
Advanced Topics
-
Front Matter
-
-
Back Matter
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.
Reviews
Authors and Affiliations
-
International Computer Institute, Ege University, Izmir, Turkey
K Erciyes
About the author
Bibliographic Information
Book Title: Guide to Graph Algorithms
Book Subtitle: Sequential, Parallel and Distributed
Authors: K Erciyes
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-3-319-73235-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG, part of Springer Nature 2018
Hardcover ISBN: 978-3-319-73234-3Published: 23 April 2018
Softcover ISBN: 978-3-030-10338-5Published: 01 February 2019
eBook ISBN: 978-3-319-73235-0Published: 13 April 2018
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 1
Number of Pages: XVIII, 471
Number of Illustrations: 246 b/w illustrations, 1 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science