Skip to content
ISBN: 0898719909
ISBN13: 9780898719901

Graph Algorithms in the Language of Linear Algebra

ISBN: 0898719909
ISBN13: 9780898719901
Formats

Conditions

Formats

Conditions

See all 1 editions

Book Overview

The field of graph algorithms has become one of the pillars of theoretical computer science, informing research in such diverse areas as combinatorial optimization, complexity theory and topology. To improve the computational performance of graph algorithms, researchers have proposed a shift to a parallel computing paradigm. This book addresses the challenges of implementing parallel graph algorithms by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation and improved performance. This description may be from another edition of this product.
Format:
Hardcover
Language:
English
ISBN:
0898719909
ISBN13:
9780898719901
Release Date:
August 2011
Publisher:
Society for Industrial and Applied Mathematic
Length:
375 Pages
Weight:
0.05 lbs.
ComputersComputers & TechnologyMathMathematicsScience & Math

More by John Gilbert

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.