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.
Read More
Specifications
Book Details
Imprint
Springer Nature Switzerland AG
Dimensions
Height
235 mm
Length
155 mm
Weight
367 gr
Be the first to ask about this product
Safe and Secure Payments.Easy returns.100% Authentic products.