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.
"synopsis" may belong to another edition of this title.
The field of graph algorithms has become one of the pillars of theoretical computer science. This is an introduction to graph algorithms accessible to anyone with a strong linear algebra background - it allows non-computer science trained engineers and scientists to quickly understand and apply graph algorithms.
Jeremy Kepner is a senior technical staff member at the Massachusetts Institute of Technology Lincoln Laboratory. His research focuses on the development of advanced libraries for the application of massively parallel computing to a variety of data intensive signal processing problems on which he has published many articles.
John Gilbert is a SIAM Fellow and Professor of Computer Science at the University of California, Santa Barbara. His research interests are in combinatorial scientific computing, high-performance graph algorithms, tools and software for computational science and engineering, numerical linear algebra and distributed sensing and control.
"About this title" may belong to another edition of this title.
Shipping:
US$ 2.64
Within U.S.A.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 18243017-n
Quantity: 13 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 361 pages. 10.50x7.25x1.00 inches. In Stock. Seller Inventory # __0898719909
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 18243017
Quantity: 13 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 2011. Hardcover. 375 pages, illustrations. An introduction to graph algorithms accessible to those without a computer science background. Cateogry: (P) Professional & Vocational. BIC Classification: UMB; UYFP. Dimension: 183 x 261 x 22. Weight: 994. . . . . . Seller Inventory # V9780898719901
Quantity: 11 available
Seller: moluna, Greven, Germany
Gebunden. Condition: New. Seller Inventory # 898976006
Quantity: Over 20 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9780898719901
Quantity: 11 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 1020. Seller Inventory # B9780898719901
Quantity: 11 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 2011. Hardcover. 375 pages, illustrations. An introduction to graph algorithms accessible to those without a computer science background. Cateogry: (P) Professional & Vocational. BIC Classification: UMB; UYFP. Dimension: 183 x 261 x 22. Weight: 994. . . . . . Books ship from the US and Ireland. Seller Inventory # V9780898719901
Quantity: 11 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780898719901_new
Quantity: 11 available