0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Algebraic Graph Algorithms - A Practical Guide Using Python (Paperback, 1st ed. 2021) Loot Price: R925
Discovery Miles 9 250
Algebraic Graph Algorithms - A Practical Guide Using Python (Paperback, 1st ed. 2021): K. Erciyes

Algebraic Graph Algorithms - A Practical Guide Using Python (Paperback, 1st ed. 2021)

K. Erciyes

Series: Undergraduate Topics in Computer Science

 (sign in to rate)
Loot Price R925 Discovery Miles 9 250 | Repayment Terms: R87 pm x 12*

Bookmark and Share

Expected to ship within 9 - 15 working days

Donate to Against Period Poverty

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.

General

Imprint: Springer Nature Switzerland AG
Country of origin: Switzerland
Series: Undergraduate Topics in Computer Science
Release date: November 2021
First published: 2021
Authors: K. Erciyes
Dimensions: 235 x 155mm (L x W)
Format: Paperback
Pages: 221
Edition: 1st ed. 2021
ISBN-13: 978-3-03-087885-6
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
LSN: 3-03-087885-6
Barcode: 9783030878856

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners