Description
| Product ID: | 9783030878856 |
| Product Form: | Paperback / softback |
| Country of Manufacture: | GB |
| Series: | Undergraduate Topics in Computer Science |
| Title: | Algebraic Graph Algorithms |
| Subtitle: | A Practical Guide Using Python |
| Authors: | Author: K. Erciyes |
| Page Count: | 221 |
| Subjects: | Discrete mathematics, Discrete mathematics, Mathematical theory of computation, Maths for computer scientists, Mathematical theory of computation, Maths for computer scientists |
| Description: | 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. 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. |
| Imprint Name: | Springer Nature Switzerland AG |
| Publisher Name: | Springer Nature Switzerland AG |
| Country of Publication: | GB |
| Publishing Date: | 2021-11-18 |
