Normal view MARC view ISBD view

Graph algorithms in the language of linear algebra

Contributor(s): Kepner, Jeremy [Editor] | Gilbert, John [Editor].
Material type: materialTypeLabelBookSeries: Software, Environments, and Tools. Publisher: Philadelphia Society for Industrial and Applied Mathematics 2011Description: xxvii, 361 p.ISBN: 9780898719901.Subject(s): Graph algorithms | Algebras - LinearDDC classification: 511.6 Summary: 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.(http://www.barnesandnoble.com/w/graph-algorithms-in-the-language-of-linear-algebra-jeremy-v-kepner/1102407915?ean=9780898719901)
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Item location Collection Call number Status Date due Barcode
Books Vikram Sarabhai Library
Slot 1358 (0 Floor, East Wing) Non-fiction 511.6 G7 (Browse shelf) Checked out 18/06/2020 189338

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.(http://www.barnesandnoble.com/w/graph-algorithms-in-the-language-of-linear-algebra-jeremy-v-kepner/1102407915?ean=9780898719901)

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha