menu
{ "item_title" : "Algebraic Graph Algorithms", "item_author" : [" K. Erciyes "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/03/087/885/3030878856_b.jpg", "price_data" : { "retail_price" : "44.99", "online_price" : "44.99", "our_price" : "44.99", "club_price" : "44.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algebraic Graph Algorithms|K. Erciyes

Algebraic Graph Algorithms : A Practical Guide Using Python

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783030878856
  • ISBN-10: 3030878856
  • Publisher: Springer
  • Publish Date: November 2021
  • Dimensions: 9.21 x 6.14 x 0.5 inches
  • Shipping Weight: 0.74 pounds
  • Page Count: 221

Related Categories

You May Also Like...

    1

BAM Customer Reviews