Algebraic Graph Algorithms: A Practical Guide Using Python
by K. Erciyes
- Length: 234 pages
- Edition: 1
- Language: English
- Publisher: Springer
- Publication Date: 2021-12-19
- ISBN-10: 3030878856
- ISBN-13: 9783030878856
- Sales Rank: #3750236 (See Top 100 Books)
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.
Cover Front Matter 1. Introduction Part I. Background 2. A Short Review of Python 3. Basic Matrix Computations 4. Graphs, Matrices and Matroids 5. Parallel and Sparse Matrix Computations Part II. Graph Algorithms 6. Trees 7. Shortest Paths 8. Connectivity and Matching 9. Subgraph Search 10. Large Graph Analysis 11. Graph Partitioning and Clustering Back Matter
Donate to keep this site alive
To access the Link, solve the captcha.
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.