Algebraic Graph Algorithms by K Erciyes
This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.
“The master’s course ‘Algorithms on graphs and networks’ has become almost mandatory at most universities in the computer science departmentThe refereed manual may be the basis of such a course, including both lectures and practical training.” (I. M. Erusalimskiy, zbMATH 1487.05001, 2022)
Dr. Kayhan Erciyes is a full Professor in the Department of Software Engineering at Maltepe University, Istanbul, Turkey. His other publications include the Springer titles Discrete Mathematics and Graph Theory, Distributed Real-Time Systems, Guide to Graph Algorithms, Distributed and Sequential Algorithms for Bioinformatics, and Distributed Graph Algorithms for Computer Networks.
| SKU | Unavailable |
| ISBN 13 | 9783030878856 |
| ISBN 10 | 3030878856 |
| Title | Algebraic Graph Algorithms |
| Author | K Erciyes |
| Series | Undergraduate Topics In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer Nature Switzerland AG |
| Year published | 2021-11-18 |
| Number of pages | 221 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |