Code: 01261519
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 perf ... more
681.69 zł
Availability:
50/50We think title might be available. Upon your order we will do our best to get it within 6 weeks.Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 397 loyalty points
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 category Books in English Computing & information technology Computer science Computer architecture & logic design
681.69 zł
Since 2008, we have served long line of book lovers, but each of them was always on the first place.
Copyright! ©2008-24 libristo.pl All rights reservedPrivacyPoučení o cookies
You & Books. All covered.
Shopping cart ( Empty )