$2.00
| Format |
|
|---|---|
| Author(s) | |
| Publisher | |
| ISBN-10 |
3030878856 |
| ISBN-13 |
978-3030878856 |
| Pages |
229 |
| Language |
English |
| Edition |
1st ed. 2021 edition | November 18, 2021 |
| File Size |
2 MB |
| Amazon Price |
$46 |
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.
Additional ISBNs:
∗ Print ISBN: 3030878864, 978-3030878863, 9783030878863
1. Introduction
2. Graphs, Matrices and Matroids
3. Parallel Matrix Algorithm Kernel
4. Basic Graph Algorithms
5. Connectivity, Matching and Matroids
6. Subgraph Search
7. Analysis of Large Graphs
8. Clustering in Complex Networks
9. Kronecker Graphs
10. Sample Algorithms for Complex Networks.
No account yet?
Create an Account 
Dentistry
Reviews
There are no reviews yet.