- Series: Software, Environments, and Tools
- Hardcover: 389 pages
- Publisher: Society for Industrial & Applied Mathematics (July 14, 2011)
- Language: English
- ISBN-10: 0898719909
- ISBN-13: 978-0898719901
- Product Dimensions: 6.8 x 0.9 x 9.7 inches
- Shipping Weight: 2 pounds (View shipping rates and policies)
- Average Customer Review: 1 customer review
- Amazon Best Sellers Rank: #796,185 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Graph Algorithms in the Language of Linear Algebra (Software, Environments, and Tools)
Use the Amazon App to scan ISBNs and compare prices.
Order now and we'll deliver when available.
"Neverworld Wake" by Marisha Pessl
Read the absorbing new psychological suspense thriller from acclaimed New York Times bestselling author Marisha Pessl. Learn more
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.
About the Author
Jeremy Kepner is a senior technical staff member at MIT Lincoln Laboratory. His research, on which he has published many articles (and the SIAM book Parallel Matlab for Multicore and Multinode Computers), focuses on the development of advanced libraries for the application of massively parallel computing to a variety of data intensive signal processing problems. Kepner is most proud of being the principal architect, principal investigator, or otherwise co-leader of several very talented teams that have produced a number of innovative technologies that have broken new ground in parallel computing. John Gilbert is a SIAM Fellow and Professor of Computer Science at the University of California at Santa Barbara. His research interests are combinatorial scientific computing, high-performance graph algorithms, sparse matrix methods, tools and software for computational science and engineering, and numerical linear algebra.