Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Graph Algorithms in the Language of Linear Algebra

Name: Graph Algorithms in the Language of Linear Algebra
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 01261519
Price: 49435 HUF
Availability: InStock
Author: Jeremy Kepner
ISBN: 9780898719901

Jeremy Kepner

Language

English

Book Hardback

Libristo code: 01261519

Publishers Society for Industrial & Applied Mathematics,U.S., July 2011

The field of graph algorithms has become one of the pillars of theoretical computer science, informi... Full description

Libristo code: 01261519

329 b

49 435 Ft

In stock at our supplier Shipping in 14-20 days

Up to 30 days for returns

Customers also purchased

Karty do gry Senior 55 listków

Cards

664 Ft

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.