You might also like

Availability alert

More about Graph Algorithms in the Language of Linear Algebra

• Book details
• Synopsis
• Trending among others

You get 415 loyalty points

Book synopsis

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.

Book details

Book category Książki po angielsku Computing & information technology Computer science Computer architecture & logic design

• Full title: Graph Algorithms in the Language of Linear Algebra
• Author: Jeremy Kepner
• Language: English
• Binding: Hardback
• Number of pages: 388
• EAN: 9780898719901
• ISBN: 0898719909
• ID: 01261519
• Publisher: Society for Industrial & Applied Mathematics,U.S.
• Weight: 99 g
• Dimensions: 183 × 261 × 22 mm
• Date of publishing: 30. July 2011

Trending among others

---

---

---