Parallel Graph Algorithms

Edited by David A. Bader

© 2016 – Chapman and Hall/CRC

400 pages | 100 B/W Illus.

Purchasing Options:
Hardback: 9781466573260
pub: 2016-01-25
e–Inspection Copy

About the Book

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

Table of Contents

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

About the Series

Chapman & Hall/CRC Computational Science

Learn more…

Subject Categories

BISAC Subject Codes/Headings:
MATHEMATICS / Arithmetic
MATHEMATICS / Combinatorics