Skip to Content

Parallel Graph Algorithms

Edited by David A. Bader

Chapman and Hall/CRC – 2015 – 400 pages

Series: Chapman & Hall/CRC Computational Science

Purchasing Options:

  • Hardback: $89.95
    978-1-46-657326-0
    April 15th 2015
    Not yet available

Description

Graph theoretic problems are representative of fundamental kernels in traditional and emerging scientific applications, such as complex network analysis, data mining, and computational biology, as well as applications in national security. Graph abstractions are also extensively used to understand and solve challenging problems in scientific computing. Real-world systems, such as the Internet, telephone networks, social interactions, and transportation networks, are analyzed by modeling them as graphs. To efficiently solve large-scale graph problems, it is necessary to design high performance computing systems and novel parallel algorithms. In this book, some of the world’s most renowned experts explore the latest research and applications in this important area

Contents

Theory. Benchmarks. Programming. Parallel Graph Algorithms. Applications. Architectures.

Name: Parallel Graph Algorithms (Hardback)Chapman and Hall/CRC 
Description: Edited by David A. Bader. Graph theoretic problems are representative of fundamental kernels in traditional and emerging scientific applications, such as complex network analysis, data mining, and computational biology, as well as applications in national security. Graph...
Categories: Algorithms & Complexity, Supercomputing, Combinatorics