Erciyes K. Algebraic Graph Algorithms...Guide Using Python 2021

Textbook in PDF format

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.
Introduction
Background
A Short Review of Python
Basic Matrix Computations
Graphs, Matrices and Matroids
Parallel and Sparse Matrix Computations
Graph Algorithms
Trees
Shortest Paths
Connectivity and Matching
Subgraph Search
Large Graph Analysis
Graph Partitioning and Clustering