
Guide to Graph Algorithms by K Erciyes
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:
- 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
- Surveys advanced graph structures used in artificial intelligence with code examples
- Reviews graph machine-intelligence methods
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 Yaşar 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.
-
Java in Two Semesters
-
The Algorithm Design Manual
-
Guide to Discrete Mathematics
-
The Discrete Math Workbook
-
Computer Vision
-
The Data Science Design Manual
-
Programming Language Design and Implementation
-
Guide to AI for Cybersecurity
-
Theory of Computation
-
Introduction to Databases
-
Mathematical Foundations of Software Engineering
-
Introduction to Assembly Language Programming
-
Computability and Complexity Theory
-
Understanding Concurrent Systems
-
Software Reliability Methods
-
Modal and Temporal Properties of Processes
-
Deduction Systems
-
Formal Languages and Compilation
-
Verification of Sequential and Concurrent Programs
-
Exploring Computational Geometry
-
Guide to Numerical Algorithm Design and Development
-
Fundamentals of the New Artificial Intelligence
-
Foundational Java
-
Guide to Graph Colouring
-
Guide to Industrial Analytics
-
Computational Intelligence
-
Guide to Intelligent Data Science
-
Programming in Two Semesters
-
Fundamentals of Computer Organization and Design
-
Algorithms on Trees and Graphs
Dr. K. Erciyes is professor of computer engineering at Yaşar 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.
| SKU | Unavailable |
| ISBN 13 | 9783032052933 |
| ISBN 10 | 3032052939 |
| Title | Guide to Graph Algorithms |
| Author | K Erciyes |
| Series | Texts In Computer Science |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer Nature Switzerland AG |
| Year published | 2026-03-13 |
| Number of pages | 490 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |





























